/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/mix023_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:00:12,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:00:12,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:00:12,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:00:12,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:00:12,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:00:12,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:00:12,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:00:12,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:00:12,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:00:12,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:00:12,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:00:12,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:00:12,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:00:12,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:00:12,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:00:12,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:00:12,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:00:12,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:00:12,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:00:12,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:00:12,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:00:12,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:00:12,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:00:12,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:00:12,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:00:12,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:00:12,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:00:12,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:00:12,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:00:12,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:00:12,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:00:12,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:00:12,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:00:12,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:00:12,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:00:12,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:00:12,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:00:12,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:00:12,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:00:12,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:00:12,267 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:00:12,301 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:00:12,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:00:12,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:00:12,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:00:12,305 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:00:12,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:00:12,305 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:00:12,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:00:12,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:00:12,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:00:12,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:00:12,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:00:12,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:00:12,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:00:12,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:00:12,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:00:12,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:00:12,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:00:12,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:00:12,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:00:12,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:00:12,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:00:12,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:00:12,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:00:12,309 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:00:12,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:00:12,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:00:12,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:00:12,633 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:00:12,633 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:00:12,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i [2021-03-26 10:00:12,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b75c0d0/b1ccc15dd55a4f4a81d9fe07fda25de9/FLAGe2232ff33 [2021-03-26 10:00:13,274 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:00:13,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i [2021-03-26 10:00:13,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b75c0d0/b1ccc15dd55a4f4a81d9fe07fda25de9/FLAGe2232ff33 [2021-03-26 10:00:13,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b75c0d0/b1ccc15dd55a4f4a81d9fe07fda25de9 [2021-03-26 10:00:13,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:00:13,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:00:13,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:00:13,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:00:13,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:00:13,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:00:13" (1/1) ... [2021-03-26 10:00:13,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1908953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:13, skipping insertion in model container [2021-03-26 10:00:13,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:00:13" (1/1) ... [2021-03-26 10:00:13,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:00:13,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:00:13,949 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/mix023_tso.opt.i[948,961] [2021-03-26 10:00:14,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:00:14,219 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:00:14,228 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/mix023_tso.opt.i[948,961] [2021-03-26 10:00:14,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:00:14,346 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:00:14,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14 WrapperNode [2021-03-26 10:00:14,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:00:14,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:00:14,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:00:14,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:00:14,353 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:00:14" (1/1) ... [2021-03-26 10:00:14,370 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:00:14" (1/1) ... [2021-03-26 10:00:14,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:00:14,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:00:14,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:00:14,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:00:14,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (1/1) ... [2021-03-26 10:00:14,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:00:14,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:00:14,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:00:14,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:00:14,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (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:00:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:00:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:00:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:00:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:00:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:00:14,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:00:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:00:14,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:00:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:00:14,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:00:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:00:14,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:00:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:00:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:00:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:00:14,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:00:14,536 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:00:18,570 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:00:18,571 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-03-26 10:00:18,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:00:18 BoogieIcfgContainer [2021-03-26 10:00:18,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:00:18,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:00:18,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:00:18,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:00:18,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:00:13" (1/3) ... [2021-03-26 10:00:18,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f707058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:00:18, skipping insertion in model container [2021-03-26 10:00:18,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:14" (2/3) ... [2021-03-26 10:00:18,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f707058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:00:18, skipping insertion in model container [2021-03-26 10:00:18,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:00:18" (3/3) ... [2021-03-26 10:00:18,578 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_tso.opt.i [2021-03-26 10:00:18,584 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:00:18,588 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-03-26 10:00:18,588 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:00:18,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,700 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,713 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:18,718 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:00:18,734 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-03-26 10:00:18,759 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:00:18,759 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:00:18,759 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:00:18,759 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:00:18,759 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:00:18,759 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:00:18,759 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:00:18,760 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:00:18,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2021-03-26 10:00:18,839 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2021-03-26 10:00:18,839 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:18,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-03-26 10:00:18,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2021-03-26 10:00:18,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2021-03-26 10:00:18,854 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:00:18,865 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2021-03-26 10:00:18,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2021-03-26 10:00:18,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2021-03-26 10:00:18,921 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2021-03-26 10:00:18,921 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:18,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-03-26 10:00:18,927 INFO L142 LiptonReduction]: Number of co-enabled transitions 2988 [2021-03-26 10:00:22,974 WARN L205 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 432 DAG size of output: 351 [2021-03-26 10:00:23,768 WARN L205 SmtUtils]: Spent 790.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2021-03-26 10:00:27,970 WARN L205 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 600 DAG size of output: 510 [2021-03-26 10:00:29,792 WARN L205 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 505 [2021-03-26 10:00:30,720 WARN L205 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2021-03-26 10:00:30,877 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:00:31,867 WARN L205 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 158 [2021-03-26 10:00:32,235 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2021-03-26 10:00:34,926 WARN L205 SmtUtils]: Spent 907.00 ms on a formula simplification that was a NOOP. DAG size: 349 [2021-03-26 10:00:35,757 WARN L205 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 349 [2021-03-26 10:00:37,777 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 507 [2021-03-26 10:00:39,818 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 507 [2021-03-26 10:00:40,182 INFO L154 LiptonReduction]: Checked pairs total: 6284 [2021-03-26 10:00:40,183 INFO L156 LiptonReduction]: Total number of compositions: 86 [2021-03-26 10:00:40,185 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21332 [2021-03-26 10:00:40,193 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 10:00:40,193 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:40,194 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:00:40,194 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:00:40,194 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:00:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:00:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1018126350, now seen corresponding path program 1 times [2021-03-26 10:00:40,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:00:40,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125065030] [2021-03-26 10:00:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:00:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:00:40,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:00:40,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:00:40,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:00:40,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:00:40,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:00:40,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125065030] [2021-03-26 10:00:40,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:00:40,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:00:40,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383032721] [2021-03-26 10:00:40,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:00:40,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:00:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:00:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:00:40,470 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 224 [2021-03-26 10:00:40,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:00:40,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:00:40,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 224 [2021-03-26 10:00:40,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:00:40,731 INFO L129 PetriNetUnfolder]: 257/622 cut-off events. [2021-03-26 10:00:40,731 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:40,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 622 events. 257/622 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3848 event pairs, 179 based on Foata normal form. 27/594 useless extension candidates. Maximal degree in co-relation 992. Up to 313 conditions per place. [2021-03-26 10:00:40,742 INFO L132 encePairwiseOnDemand]: 220/224 looper letters, 14 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2021-03-26 10:00:40,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 166 flow [2021-03-26 10:00:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:00:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:00:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2021-03-26 10:00:40,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2021-03-26 10:00:40,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2021-03-26 10:00:40,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2021-03-26 10:00:40,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:00:40,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2021-03-26 10:00:40,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have 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:00:40,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:00:40,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:00:40,772 INFO L185 Difference]: Start difference. First operand has 70 places, 58 transitions, 128 flow. Second operand 3 states and 622 transitions. [2021-03-26 10:00:40,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 166 flow [2021-03-26 10:00:40,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:00:40,775 INFO L241 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2021-03-26 10:00:40,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2021-03-26 10:00:40,777 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2021-03-26 10:00:40,778 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:00:40,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 55 transitions, 122 flow [2021-03-26 10:00:40,779 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 122 flow [2021-03-26 10:00:40,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 122 flow [2021-03-26 10:00:40,814 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-03-26 10:00:40,814 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:40,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 55 events. 0/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:00:40,815 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-26 10:00:42,321 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 358 [2021-03-26 10:00:43,272 WARN L205 SmtUtils]: Spent 948.00 ms on a formula simplification that was a NOOP. DAG size: 358 [2021-03-26 10:00:47,657 WARN L205 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 522 DAG size of output: 520 [2021-03-26 10:00:49,989 WARN L205 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 519 [2021-03-26 10:00:51,105 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 350 [2021-03-26 10:00:52,147 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 350 [2021-03-26 10:00:54,441 WARN L205 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 508 [2021-03-26 10:00:56,851 WARN L205 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 508 [2021-03-26 10:01:01,706 WARN L205 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 364 DAG size of output: 363 [2021-03-26 10:01:02,997 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 361 [2021-03-26 10:01:07,820 WARN L205 SmtUtils]: Spent 4.82 s on a formula simplification that was a NOOP. DAG size: 525 [2021-03-26 10:01:11,219 WARN L205 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 523 [2021-03-26 10:01:11,495 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 10:01:11,612 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 10:01:11,726 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 10:01:11,853 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 10:01:12,126 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:01:12,297 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:01:12,485 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:01:12,673 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:01:12,684 INFO L154 LiptonReduction]: Checked pairs total: 3191 [2021-03-26 10:01:12,684 INFO L156 LiptonReduction]: Total number of compositions: 18 [2021-03-26 10:01:12,685 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31907 [2021-03-26 10:01:12,686 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2021-03-26 10:01:12,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:01:12,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:12,686 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:01:12,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:01:12,686 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1906941473, now seen corresponding path program 1 times [2021-03-26 10:01:12,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:12,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064696635] [2021-03-26 10:01:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:12,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:12,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:12,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:12,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:12,796 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:01:12,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064696635] [2021-03-26 10:01:12,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:12,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:01:12,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825352928] [2021-03-26 10:01:12,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:01:12,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:12,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:01:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:01:12,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 242 [2021-03-26 10:01:12,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have 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:01:12,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:12,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 242 [2021-03-26 10:01:12,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:12,899 INFO L129 PetriNetUnfolder]: 33/109 cut-off events. [2021-03-26 10:01:12,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:12,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 109 events. 33/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 3 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 175. Up to 55 conditions per place. [2021-03-26 10:01:12,900 INFO L132 encePairwiseOnDemand]: 239/242 looper letters, 8 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2021-03-26 10:01:12,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 116 flow [2021-03-26 10:01:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:01:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:01:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-03-26 10:01:12,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90633608815427 [2021-03-26 10:01:12,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-03-26 10:01:12,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-03-26 10:01:12,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:12,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-03-26 10:01:12,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:12,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have 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:01:12,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have 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:01:12,910 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 658 transitions. [2021-03-26 10:01:12,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 116 flow [2021-03-26 10:01:12,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:12,912 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 80 flow [2021-03-26 10:01:12,912 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-26 10:01:12,912 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2021-03-26 10:01:12,912 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:12,912 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 80 flow [2021-03-26 10:01:12,913 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 80 flow [2021-03-26 10:01:12,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 80 flow [2021-03-26 10:01:12,918 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:01:12,918 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:12,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:01:12,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 490 [2021-03-26 10:01:13,221 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:01:13,443 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:01:13,663 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:01:13,880 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:01:14,212 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 10:01:14,314 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 10:01:14,417 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 10:01:14,536 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 10:01:14,541 INFO L154 LiptonReduction]: Checked pairs total: 1920 [2021-03-26 10:01:14,541 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:01:14,541 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1629 [2021-03-26 10:01:14,542 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 10:01:14,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have 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:01:14,543 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:14,543 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:14,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:01:14,543 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:14,543 INFO L82 PathProgramCache]: Analyzing trace with hash 881615090, now seen corresponding path program 1 times [2021-03-26 10:01:14,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:14,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684715482] [2021-03-26 10:01:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:14,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:14,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:01:14,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:14,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:01:14,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:14,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:01:14,753 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:01:14,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684715482] [2021-03-26 10:01:14,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:14,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:01:14,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549664754] [2021-03-26 10:01:14,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:14,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:14,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:14,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 245 [2021-03-26 10:01:14,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:01:14,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:14,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 245 [2021-03-26 10:01:14,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:15,019 INFO L129 PetriNetUnfolder]: 293/502 cut-off events. [2021-03-26 10:01:15,019 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:15,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 502 events. 293/502 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2590 event pairs, 216 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 940. Up to 431 conditions per place. [2021-03-26 10:01:15,023 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 11 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-26 10:01:15,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 134 flow [2021-03-26 10:01:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:01:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:01:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 826 transitions. [2021-03-26 10:01:15,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2021-03-26 10:01:15,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 826 transitions. [2021-03-26 10:01:15,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 826 transitions. [2021-03-26 10:01:15,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:15,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 826 transitions. [2021-03-26 10:01:15,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:15,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have 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:01:15,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have 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:01:15,034 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 4 states and 826 transitions. [2021-03-26 10:01:15,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 134 flow [2021-03-26 10:01:15,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:15,036 INFO L241 Difference]: Finished difference. Result has 45 places, 39 transitions, 128 flow [2021-03-26 10:01:15,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=70, 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2021-03-26 10:01:15,036 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2021-03-26 10:01:15,036 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:15,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 128 flow [2021-03-26 10:01:15,037 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 128 flow [2021-03-26 10:01:15,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 128 flow [2021-03-26 10:01:15,060 INFO L129 PetriNetUnfolder]: 20/109 cut-off events. [2021-03-26 10:01:15,061 INFO L130 PetriNetUnfolder]: For 10/17 co-relation queries the response was YES. [2021-03-26 10:01:15,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 109 events. 20/109 cut-off events. For 10/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 510 event pairs, 6 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 181. Up to 31 conditions per place. [2021-03-26 10:01:15,063 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-26 10:01:16,394 WARN L205 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 165 [2021-03-26 10:01:16,685 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-03-26 10:01:18,759 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 334 DAG size of output: 230 [2021-03-26 10:01:19,314 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 10:01:20,506 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-26 10:01:20,974 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-26 10:01:22,001 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-26 10:01:22,492 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-26 10:01:22,594 INFO L154 LiptonReduction]: Checked pairs total: 1056 [2021-03-26 10:01:22,594 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:01:22,594 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7558 [2021-03-26 10:01:22,595 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 128 flow [2021-03-26 10:01:22,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:01:22,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:22,596 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:22,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:01:22,596 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash 841553222, now seen corresponding path program 1 times [2021-03-26 10:01:22,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:22,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558669150] [2021-03-26 10:01:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:22,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:22,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:22,701 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:01:22,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558669150] [2021-03-26 10:01:22,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:22,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:01:22,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272846743] [2021-03-26 10:01:22,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:01:22,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:01:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:01:22,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 247 [2021-03-26 10:01:22,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:22,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:22,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 247 [2021-03-26 10:01:22,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:22,743 INFO L129 PetriNetUnfolder]: 16/74 cut-off events. [2021-03-26 10:01:22,743 INFO L130 PetriNetUnfolder]: For 30/43 co-relation queries the response was YES. [2021-03-26 10:01:22,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 74 events. 16/74 cut-off events. For 30/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 264 event pairs, 6 based on Foata normal form. 3/69 useless extension candidates. Maximal degree in co-relation 129. Up to 29 conditions per place. [2021-03-26 10:01:22,744 INFO L132 encePairwiseOnDemand]: 243/247 looper letters, 1 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-26 10:01:22,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 136 flow [2021-03-26 10:01:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:01:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:01:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2021-03-26 10:01:22,749 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9095816464237517 [2021-03-26 10:01:22,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2021-03-26 10:01:22,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2021-03-26 10:01:22,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:22,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2021-03-26 10:01:22,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have 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:01:22,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:01:22,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:01:22,753 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 128 flow. Second operand 3 states and 674 transitions. [2021-03-26 10:01:22,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 136 flow [2021-03-26 10:01:22,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 134 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:01:22,755 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 137 flow [2021-03-26 10:01:22,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 10:01:22,755 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2021-03-26 10:01:22,755 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:22,756 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 137 flow [2021-03-26 10:01:22,756 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 137 flow [2021-03-26 10:01:22,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 137 flow [2021-03-26 10:01:22,768 INFO L129 PetriNetUnfolder]: 19/92 cut-off events. [2021-03-26 10:01:22,769 INFO L130 PetriNetUnfolder]: For 8/12 co-relation queries the response was YES. [2021-03-26 10:01:22,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 92 events. 19/92 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 369 event pairs, 7 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 157. Up to 36 conditions per place. [2021-03-26 10:01:22,770 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-26 10:01:23,061 INFO L154 LiptonReduction]: Checked pairs total: 572 [2021-03-26 10:01:23,061 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:23,061 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 306 [2021-03-26 10:01:23,062 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 137 flow [2021-03-26 10:01:23,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:23,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:23,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:23,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:01:23,063 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:23,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1636009836, now seen corresponding path program 1 times [2021-03-26 10:01:23,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:23,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481378462] [2021-03-26 10:01:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:23,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:23,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:23,151 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:01:23,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481378462] [2021-03-26 10:01:23,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:23,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:01:23,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044336090] [2021-03-26 10:01:23,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:01:23,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:01:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:01:23,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 247 [2021-03-26 10:01:23,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:01:23,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:23,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 247 [2021-03-26 10:01:23,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:23,184 INFO L129 PetriNetUnfolder]: 16/74 cut-off events. [2021-03-26 10:01:23,184 INFO L130 PetriNetUnfolder]: For 22/32 co-relation queries the response was YES. [2021-03-26 10:01:23,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 74 events. 16/74 cut-off events. For 22/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 6 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 134. Up to 29 conditions per place. [2021-03-26 10:01:23,185 INFO L132 encePairwiseOnDemand]: 244/247 looper letters, 1 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-03-26 10:01:23,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 143 flow [2021-03-26 10:01:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:01:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:01:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2021-03-26 10:01:23,190 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9163292847503374 [2021-03-26 10:01:23,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2021-03-26 10:01:23,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2021-03-26 10:01:23,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:23,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2021-03-26 10:01:23,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have 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:01:23,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:01:23,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:01:23,194 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 137 flow. Second operand 3 states and 679 transitions. [2021-03-26 10:01:23,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 143 flow [2021-03-26 10:01:23,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 133 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:23,196 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 135 flow [2021-03-26 10:01:23,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2021-03-26 10:01:23,196 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2021-03-26 10:01:23,196 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:23,196 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 38 transitions, 135 flow [2021-03-26 10:01:23,197 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 135 flow [2021-03-26 10:01:23,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 135 flow [2021-03-26 10:01:23,209 INFO L129 PetriNetUnfolder]: 19/92 cut-off events. [2021-03-26 10:01:23,210 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:01:23,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 92 events. 19/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 370 event pairs, 7 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 154. Up to 36 conditions per place. [2021-03-26 10:01:23,211 INFO L142 LiptonReduction]: Number of co-enabled transitions 636 [2021-03-26 10:01:23,302 INFO L154 LiptonReduction]: Checked pairs total: 547 [2021-03-26 10:01:23,302 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:23,303 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 10:01:23,303 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 135 flow [2021-03-26 10:01:23,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:01:23,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:23,304 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:23,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:01:23,304 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash 279503833, now seen corresponding path program 1 times [2021-03-26 10:01:23,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:23,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398870369] [2021-03-26 10:01:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:23,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:23,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:23,475 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:23,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:23,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:23,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:23,491 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:01:23,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398870369] [2021-03-26 10:01:23,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:23,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:23,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852232234] [2021-03-26 10:01:23,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:23,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:23,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:23,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:23,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-26 10:01:23,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 212.75) internal successors, (851), 4 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:01:23,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:23,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-26 10:01:23,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:23,668 INFO L129 PetriNetUnfolder]: 276/536 cut-off events. [2021-03-26 10:01:23,668 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-26 10:01:23,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 536 events. 276/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3286 event pairs, 126 based on Foata normal form. 41/462 useless extension candidates. Maximal degree in co-relation 1089. Up to 387 conditions per place. [2021-03-26 10:01:23,673 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 12 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2021-03-26 10:01:23,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 207 flow [2021-03-26 10:01:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:01:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:01:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1084 transitions. [2021-03-26 10:01:23,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8777327935222672 [2021-03-26 10:01:23,678 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1084 transitions. [2021-03-26 10:01:23,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1084 transitions. [2021-03-26 10:01:23,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:23,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1084 transitions. [2021-03-26 10:01:23,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have 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:01:23,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have 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:01:23,684 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have 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:01:23,684 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 135 flow. Second operand 5 states and 1084 transitions. [2021-03-26 10:01:23,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 207 flow [2021-03-26 10:01:23,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:23,687 INFO L241 Difference]: Finished difference. Result has 53 places, 47 transitions, 206 flow [2021-03-26 10:01:23,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2021-03-26 10:01:23,687 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2021-03-26 10:01:23,687 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:23,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 206 flow [2021-03-26 10:01:23,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 206 flow [2021-03-26 10:01:23,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 206 flow [2021-03-26 10:01:23,746 INFO L129 PetriNetUnfolder]: 245/530 cut-off events. [2021-03-26 10:01:23,747 INFO L130 PetriNetUnfolder]: For 340/596 co-relation queries the response was YES. [2021-03-26 10:01:23,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 530 events. 245/530 cut-off events. For 340/596 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3430 event pairs, 109 based on Foata normal form. 3/462 useless extension candidates. Maximal degree in co-relation 1461. Up to 363 conditions per place. [2021-03-26 10:01:23,755 INFO L142 LiptonReduction]: Number of co-enabled transitions 816 [2021-03-26 10:01:23,854 INFO L154 LiptonReduction]: Checked pairs total: 1139 [2021-03-26 10:01:23,854 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:23,855 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-03-26 10:01:23,855 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 200 flow [2021-03-26 10:01:23,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 212.75) internal successors, (851), 4 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:01:23,857 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:23,857 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:23,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:01:23,857 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:23,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1602860992, now seen corresponding path program 1 times [2021-03-26 10:01:23,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:23,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041576388] [2021-03-26 10:01:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:23,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:23,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:23,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:23,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:23,999 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:24,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:24,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:24,018 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:01:24,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041576388] [2021-03-26 10:01:24,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:24,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:24,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301095705] [2021-03-26 10:01:24,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:24,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:24,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-26 10:01:24,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:01:24,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:24,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-26 10:01:24,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:24,197 INFO L129 PetriNetUnfolder]: 208/430 cut-off events. [2021-03-26 10:01:24,197 INFO L130 PetriNetUnfolder]: For 363/763 co-relation queries the response was YES. [2021-03-26 10:01:24,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 430 events. 208/430 cut-off events. For 363/763 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2427 event pairs, 27 based on Foata normal form. 70/448 useless extension candidates. Maximal degree in co-relation 1473. Up to 298 conditions per place. [2021-03-26 10:01:24,202 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 13 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2021-03-26 10:01:24,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 310 flow [2021-03-26 10:01:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1301 transitions. [2021-03-26 10:01:24,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8778677462887989 [2021-03-26 10:01:24,208 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1301 transitions. [2021-03-26 10:01:24,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1301 transitions. [2021-03-26 10:01:24,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:24,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1301 transitions. [2021-03-26 10:01:24,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have 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:01:24,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have 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:01:24,214 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have 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:01:24,214 INFO L185 Difference]: Start difference. First operand has 53 places, 46 transitions, 200 flow. Second operand 6 states and 1301 transitions. [2021-03-26 10:01:24,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 310 flow [2021-03-26 10:01:24,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 303 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:24,221 INFO L241 Difference]: Finished difference. Result has 57 places, 51 transitions, 289 flow [2021-03-26 10:01:24,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2021-03-26 10:01:24,221 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2021-03-26 10:01:24,222 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:24,222 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 289 flow [2021-03-26 10:01:24,222 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 289 flow [2021-03-26 10:01:24,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 289 flow [2021-03-26 10:01:24,262 INFO L129 PetriNetUnfolder]: 134/322 cut-off events. [2021-03-26 10:01:24,262 INFO L130 PetriNetUnfolder]: For 799/1142 co-relation queries the response was YES. [2021-03-26 10:01:24,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 322 events. 134/322 cut-off events. For 799/1142 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1849 event pairs, 26 based on Foata normal form. 10/310 useless extension candidates. Maximal degree in co-relation 1278. Up to 224 conditions per place. [2021-03-26 10:01:24,268 INFO L142 LiptonReduction]: Number of co-enabled transitions 904 [2021-03-26 10:01:24,733 INFO L154 LiptonReduction]: Checked pairs total: 1334 [2021-03-26 10:01:24,734 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:24,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 512 [2021-03-26 10:01:24,735 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 281 flow [2021-03-26 10:01:24,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:01:24,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:24,736 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:01:24,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:01:24,737 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -505282077, now seen corresponding path program 1 times [2021-03-26 10:01:24,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:24,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410909038] [2021-03-26 10:01:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:24,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:24,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:24,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:24,901 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:24,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:24,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:24,923 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:01:24,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410909038] [2021-03-26 10:01:24,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:24,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:24,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554386910] [2021-03-26 10:01:24,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:01:24,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:24,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:01:24,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:01:24,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-26 10:01:24,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have 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:01:24,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:24,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-26 10:01:24,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:25,117 INFO L129 PetriNetUnfolder]: 149/316 cut-off events. [2021-03-26 10:01:25,117 INFO L130 PetriNetUnfolder]: For 737/1278 co-relation queries the response was YES. [2021-03-26 10:01:25,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 316 events. 149/316 cut-off events. For 737/1278 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1564 event pairs, 8 based on Foata normal form. 71/344 useless extension candidates. Maximal degree in co-relation 1373. Up to 207 conditions per place. [2021-03-26 10:01:25,121 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 10 selfloop transitions, 18 changer transitions 4/62 dead transitions. [2021-03-26 10:01:25,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 437 flow [2021-03-26 10:01:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:01:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:01:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1518 transitions. [2021-03-26 10:01:25,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8779641411220359 [2021-03-26 10:01:25,128 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1518 transitions. [2021-03-26 10:01:25,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1518 transitions. [2021-03-26 10:01:25,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:25,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1518 transitions. [2021-03-26 10:01:25,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 216.85714285714286) internal successors, (1518), 7 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have 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:01:25,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have 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:01:25,135 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have 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:01:25,135 INFO L185 Difference]: Start difference. First operand has 57 places, 50 transitions, 281 flow. Second operand 7 states and 1518 transitions. [2021-03-26 10:01:25,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 437 flow [2021-03-26 10:01:25,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 375 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:01:25,142 INFO L241 Difference]: Finished difference. Result has 60 places, 55 transitions, 341 flow [2021-03-26 10:01:25,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2021-03-26 10:01:25,142 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2021-03-26 10:01:25,142 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:25,143 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 341 flow [2021-03-26 10:01:25,143 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 55 transitions, 341 flow [2021-03-26 10:01:25,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 341 flow [2021-03-26 10:01:25,167 INFO L129 PetriNetUnfolder]: 72/201 cut-off events. [2021-03-26 10:01:25,168 INFO L130 PetriNetUnfolder]: For 389/432 co-relation queries the response was YES. [2021-03-26 10:01:25,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 201 events. 72/201 cut-off events. For 389/432 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 889 event pairs, 8 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 754. Up to 114 conditions per place. [2021-03-26 10:01:25,171 INFO L142 LiptonReduction]: Number of co-enabled transitions 912 [2021-03-26 10:01:25,242 INFO L154 LiptonReduction]: Checked pairs total: 1645 [2021-03-26 10:01:25,242 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:25,242 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 100 [2021-03-26 10:01:25,246 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 331 flow [2021-03-26 10:01:25,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have 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:01:25,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:25,247 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:25,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:01:25,247 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1655468544, now seen corresponding path program 1 times [2021-03-26 10:01:25,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:25,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861917450] [2021-03-26 10:01:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:25,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:25,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:25,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:25,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:25,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:25,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:25,355 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:01:25,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861917450] [2021-03-26 10:01:25,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:25,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:25,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556139088] [2021-03-26 10:01:25,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:25,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:25,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:25,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:25,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 247 [2021-03-26 10:01:25,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have 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:01:25,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:25,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 247 [2021-03-26 10:01:25,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:25,430 INFO L129 PetriNetUnfolder]: 114/291 cut-off events. [2021-03-26 10:01:25,430 INFO L130 PetriNetUnfolder]: For 522/563 co-relation queries the response was YES. [2021-03-26 10:01:25,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 291 events. 114/291 cut-off events. For 522/563 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1442 event pairs, 16 based on Foata normal form. 7/273 useless extension candidates. Maximal degree in co-relation 1027. Up to 150 conditions per place. [2021-03-26 10:01:25,433 INFO L132 encePairwiseOnDemand]: 244/247 looper letters, 4 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-26 10:01:25,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 303 flow [2021-03-26 10:01:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:01:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:01:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 891 transitions. [2021-03-26 10:01:25,439 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9018218623481782 [2021-03-26 10:01:25,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 891 transitions. [2021-03-26 10:01:25,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 891 transitions. [2021-03-26 10:01:25,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:25,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 891 transitions. [2021-03-26 10:01:25,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 222.75) internal successors, (891), 4 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have 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:01:25,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have 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:01:25,443 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have 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:01:25,443 INFO L185 Difference]: Start difference. First operand has 60 places, 54 transitions, 331 flow. Second operand 4 states and 891 transitions. [2021-03-26 10:01:25,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 303 flow [2021-03-26 10:01:25,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 262 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 10:01:25,448 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 255 flow [2021-03-26 10:01:25,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-03-26 10:01:25,449 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2021-03-26 10:01:25,449 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:25,449 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 255 flow [2021-03-26 10:01:25,449 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 255 flow [2021-03-26 10:01:25,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 255 flow [2021-03-26 10:01:25,483 INFO L129 PetriNetUnfolder]: 113/294 cut-off events. [2021-03-26 10:01:25,483 INFO L130 PetriNetUnfolder]: For 292/299 co-relation queries the response was YES. [2021-03-26 10:01:25,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 294 events. 113/294 cut-off events. For 292/299 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1520 event pairs, 16 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 846. Up to 108 conditions per place. [2021-03-26 10:01:25,487 INFO L142 LiptonReduction]: Number of co-enabled transitions 828 [2021-03-26 10:01:26,150 INFO L154 LiptonReduction]: Checked pairs total: 586 [2021-03-26 10:01:26,150 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:26,150 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 701 [2021-03-26 10:01:26,151 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 255 flow [2021-03-26 10:01:26,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have 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:01:26,151 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:26,151 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:26,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:01:26,152 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1904866306, now seen corresponding path program 2 times [2021-03-26 10:01:26,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:26,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129204095] [2021-03-26 10:01:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:26,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:26,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:26,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:26,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:26,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:26,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:26,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:26,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:26,379 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:01:26,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:01:26,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:26,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:26,403 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:01:26,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129204095] [2021-03-26 10:01:26,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:26,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:01:26,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76657043] [2021-03-26 10:01:26,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:26,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:26,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-26 10:01:26,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 212.85714285714286) internal successors, (1490), 7 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have 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:01:26,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:26,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-26 10:01:26,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:26,640 INFO L129 PetriNetUnfolder]: 246/477 cut-off events. [2021-03-26 10:01:26,640 INFO L130 PetriNetUnfolder]: For 576/918 co-relation queries the response was YES. [2021-03-26 10:01:26,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 477 events. 246/477 cut-off events. For 576/918 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2456 event pairs, 12 based on Foata normal form. 64/464 useless extension candidates. Maximal degree in co-relation 1646. Up to 173 conditions per place. [2021-03-26 10:01:26,646 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 6 selfloop transitions, 18 changer transitions 5/60 dead transitions. [2021-03-26 10:01:26,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 369 flow [2021-03-26 10:01:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:01:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:01:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1727 transitions. [2021-03-26 10:01:26,653 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8739878542510121 [2021-03-26 10:01:26,653 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1727 transitions. [2021-03-26 10:01:26,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1727 transitions. [2021-03-26 10:01:26,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:26,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1727 transitions. [2021-03-26 10:01:26,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 215.875) internal successors, (1727), 8 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have 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:01:26,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have 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:01:26,663 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have 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:01:26,663 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 255 flow. Second operand 8 states and 1727 transitions. [2021-03-26 10:01:26,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 369 flow [2021-03-26 10:01:26,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 343 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 10:01:26,671 INFO L241 Difference]: Finished difference. Result has 66 places, 52 transitions, 297 flow [2021-03-26 10:01:26,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=297, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2021-03-26 10:01:26,671 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2021-03-26 10:01:26,672 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:26,672 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 52 transitions, 297 flow [2021-03-26 10:01:26,672 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 52 transitions, 297 flow [2021-03-26 10:01:26,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 297 flow [2021-03-26 10:01:26,698 INFO L129 PetriNetUnfolder]: 97/254 cut-off events. [2021-03-26 10:01:26,698 INFO L130 PetriNetUnfolder]: For 383/418 co-relation queries the response was YES. [2021-03-26 10:01:26,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 254 events. 97/254 cut-off events. For 383/418 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1212 event pairs, 12 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 868. Up to 91 conditions per place. [2021-03-26 10:01:26,702 INFO L142 LiptonReduction]: Number of co-enabled transitions 774 [2021-03-26 10:01:30,863 WARN L205 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 441 DAG size of output: 334 [2021-03-26 10:01:32,219 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 302 [2021-03-26 10:01:41,312 WARN L205 SmtUtils]: Spent 9.09 s on a formula simplification. DAG size of input: 643 DAG size of output: 487 [2021-03-26 10:01:44,443 WARN L205 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 452 [2021-03-26 10:01:46,016 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 314 [2021-03-26 10:01:47,625 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 314 [2021-03-26 10:01:51,176 WARN L205 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 464 [2021-03-26 10:01:54,958 WARN L205 SmtUtils]: Spent 3.78 s on a formula simplification that was a NOOP. DAG size: 464 [2021-03-26 10:01:54,969 INFO L154 LiptonReduction]: Checked pairs total: 1721 [2021-03-26 10:01:54,969 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:01:54,970 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28298 [2021-03-26 10:01:54,970 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 281 flow [2021-03-26 10:01:54,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 212.85714285714286) internal successors, (1490), 7 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have 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:01:54,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:54,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:54,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:01:54,971 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1994005618, now seen corresponding path program 1 times [2021-03-26 10:01:54,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:54,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589205169] [2021-03-26 10:01:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:55,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:01:55,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 10:01:55,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 10:01:55,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 10:01:55,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 10:01:55,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 10:01:55,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:01:55,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:55,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:01:55,724 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:01:55,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589205169] [2021-03-26 10:01:55,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:55,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 10:01:55,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664910362] [2021-03-26 10:01:55,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 10:01:55,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 10:01:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-03-26 10:01:55,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 249 [2021-03-26 10:01:55,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 281 flow. Second operand has 10 states, 10 states have (on average 179.1) internal successors, (1791), 10 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have 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:01:55,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:55,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 249 [2021-03-26 10:01:55,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:55,953 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2021-03-26 10:01:57,045 INFO L129 PetriNetUnfolder]: 939/1860 cut-off events. [2021-03-26 10:01:57,045 INFO L130 PetriNetUnfolder]: For 6951/7505 co-relation queries the response was YES. [2021-03-26 10:01:57,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 1860 events. 939/1860 cut-off events. For 6951/7505 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13213 event pairs, 105 based on Foata normal form. 191/1954 useless extension candidates. Maximal degree in co-relation 6016. Up to 444 conditions per place. [2021-03-26 10:01:57,064 INFO L132 encePairwiseOnDemand]: 240/249 looper letters, 35 selfloop transitions, 20 changer transitions 10/95 dead transitions. [2021-03-26 10:01:57,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 581 flow [2021-03-26 10:01:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:01:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:01:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1475 transitions. [2021-03-26 10:01:57,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7404618473895582 [2021-03-26 10:01:57,072 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1475 transitions. [2021-03-26 10:01:57,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1475 transitions. [2021-03-26 10:01:57,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:57,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1475 transitions. [2021-03-26 10:01:57,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 184.375) internal successors, (1475), 8 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have 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:01:57,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have 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:01:57,080 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have 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:01:57,080 INFO L185 Difference]: Start difference. First operand has 62 places, 49 transitions, 281 flow. Second operand 8 states and 1475 transitions. [2021-03-26 10:01:57,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 581 flow [2021-03-26 10:01:57,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 514 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-03-26 10:01:57,113 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 398 flow [2021-03-26 10:01:57,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=398, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2021-03-26 10:01:57,113 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2021-03-26 10:01:57,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:57,114 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 68 transitions, 398 flow [2021-03-26 10:01:57,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 398 flow [2021-03-26 10:01:57,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 68 transitions, 398 flow [2021-03-26 10:01:57,230 INFO L129 PetriNetUnfolder]: 486/1088 cut-off events. [2021-03-26 10:01:57,230 INFO L130 PetriNetUnfolder]: For 1233/1306 co-relation queries the response was YES. [2021-03-26 10:01:57,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3204 conditions, 1088 events. 486/1088 cut-off events. For 1233/1306 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7973 event pairs, 47 based on Foata normal form. 26/1014 useless extension candidates. Maximal degree in co-relation 3180. Up to 323 conditions per place. [2021-03-26 10:01:57,250 INFO L142 LiptonReduction]: Number of co-enabled transitions 1048 [2021-03-26 10:01:57,578 INFO L154 LiptonReduction]: Checked pairs total: 776 [2021-03-26 10:01:57,578 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:57,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 465 [2021-03-26 10:01:57,579 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 400 flow [2021-03-26 10:01:57,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 179.1) internal successors, (1791), 10 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have 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:01:57,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:57,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:57,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:01:57,580 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash -762169124, now seen corresponding path program 1 times [2021-03-26 10:01:57,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:57,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533543519] [2021-03-26 10:01:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:57,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:01:57,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:01:57,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 10:01:57,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:01:57,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:57,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:01:57,915 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:01:57,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533543519] [2021-03-26 10:01:57,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:57,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:57,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208334013] [2021-03-26 10:01:57,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:57,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:57,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 250 [2021-03-26 10:01:57,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 193.14285714285714) internal successors, (1352), 7 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have 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:01:57,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:57,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 250 [2021-03-26 10:01:57,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:58,666 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2426] L891-->L903: Formula: (let ((.cse24 (= 0 (mod v_~x$w_buff0_used~0_640 256))) (.cse10 (= (mod v_~x$r_buff1_thd4~0_62 256) 0)) (.cse26 (= (mod v_~x$w_buff1_used~0_493 256) 0)) (.cse25 (= (mod v_~x$r_buff0_thd4~0_72 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_639 256) 0)) (.cse21 (= (mod v_~z$w_buff0_used~0_563 256) 0)) (.cse28 (= (mod v_~z$w_buff1_used~0_427 256) 0)) (.cse23 (= (mod v_~z$r_buff1_thd4~0_183 256) 0)) (.cse27 (= (mod v_~z$r_buff0_thd4~0_247 256) 0)) (.cse29 (= (mod v_~z$w_buff0_used~0_564 256) 0))) (let ((.cse0 (or .cse27 .cse29)) (.cse1 (not .cse29)) (.cse13 (or .cse28 .cse23)) (.cse15 (not .cse28)) (.cse16 (or .cse27 .cse21)) (.cse2 (not .cse27)) (.cse9 (not .cse11)) (.cse12 (or .cse11 .cse25)) (.cse17 (not .cse21)) (.cse14 (not .cse23)) (.cse18 (not .cse26)) (.cse6 (not .cse10)) (.cse19 (or .cse26 .cse10)) (.cse3 (or .cse24 .cse25)) (.cse4 (not .cse25)) (.cse5 (not .cse24))) (and (or (and (= v_~z$w_buff0_used~0_564 v_~z$w_buff0_used~0_563) .cse0) (and .cse1 .cse2 (= v_~z$w_buff0_used~0_563 0))) (or (and .cse3 (= v_~x$w_buff0_used~0_640 v_~x$w_buff0_used~0_639)) (and .cse4 (= v_~x$w_buff0_used~0_639 0) .cse5)) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_492 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd4~0_71 256) 0))) (or (and (= v_~x$r_buff1_thd4~0_61 0) (or (and .cse6 (not .cse7)) (and (not .cse8) .cse9))) (and (or .cse7 .cse10) (= v_~x$r_buff1_thd4~0_62 v_~x$r_buff1_thd4~0_61) (or .cse8 .cse11)))) (or (and .cse4 .cse9 (= v_~x$r_buff0_thd4~0_71 0)) (and .cse12 (= v_~x$r_buff0_thd4~0_72 v_~x$r_buff0_thd4~0_71))) (or (and (= |v_P3_#t~ite81_41| v_~z~0_213) .cse0 (or (and .cse13 (= |v_P3_#t~ite81_41| v_~z~0_214)) (and .cse14 (= |v_P3_#t~ite81_41| v_~z$w_buff1~0_176) .cse15))) (and (= v_~z$w_buff0~0_161 v_~z~0_213) .cse1 .cse2 (= |v_P3_#t~ite81_41| |v_P3Thread1of1ForFork2_#t~ite81_1|))) (or (and (= v_~z$w_buff1_used~0_427 v_~z$w_buff1_used~0_426) .cse13 .cse16) (and (or (and .cse2 .cse17) (and .cse14 .cse15)) (= v_~z$w_buff1_used~0_426 0))) (or (and .cse16 (= v_~z$r_buff0_thd4~0_247 v_~z$r_buff0_thd4~0_246)) (and .cse2 .cse17 (= v_~z$r_buff0_thd4~0_246 0))) (or (and (or (and .cse18 .cse6) (and .cse4 .cse9)) (= v_~x$w_buff1_used~0_492 0)) (and .cse12 .cse19 (= v_~x$w_buff1_used~0_493 v_~x$w_buff1_used~0_492))) (let ((.cse20 (= (mod v_~z$r_buff0_thd4~0_246 256) 0)) (.cse22 (= (mod v_~z$w_buff1_used~0_426 256) 0))) (or (and (or .cse20 .cse21) (or .cse22 .cse23) (= v_~z$r_buff1_thd4~0_182 v_~z$r_buff1_thd4~0_183)) (and (= v_~z$r_buff1_thd4~0_182 0) (or (and (not .cse20) .cse17) (and (not .cse22) .cse14))))) (or (and (or (and .cse18 .cse6 (= |v_P3_#t~ite75_35| v_~x$w_buff1~0_190)) (and (= |v_P3_#t~ite75_35| v_~x~0_246) .cse19)) .cse3 (= |v_P3_#t~ite75_35| v_~x~0_245)) (and (= |v_P3_#t~ite75_35| |v_P3Thread1of1ForFork2_#t~ite75_1|) .cse4 .cse5 (= v_~x$w_buff0~0_163 v_~x~0_245)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_163, P3Thread1of1ForFork2_#t~ite75=|v_P3Thread1of1ForFork2_#t~ite75_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_183, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_564, ~z$w_buff0~0=v_~z$w_buff0~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_427, ~z$w_buff1~0=v_~z$w_buff1~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_493, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_72, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_640, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_247, ~z~0=v_~z~0_214, P3Thread1of1ForFork2_#t~ite81=|v_P3Thread1of1ForFork2_#t~ite81_1|, ~x~0=v_~x~0_246} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_163, P3Thread1of1ForFork2_#t~ite76=|v_P3Thread1of1ForFork2_#t~ite76_1|, P3Thread1of1ForFork2_#t~ite75=|v_P3Thread1of1ForFork2_#t~ite75_2|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_182, P3Thread1of1ForFork2_#t~ite78=|v_P3Thread1of1ForFork2_#t~ite78_1|, P3Thread1of1ForFork2_#t~ite77=|v_P3Thread1of1ForFork2_#t~ite77_1|, P3Thread1of1ForFork2_#t~ite79=|v_P3Thread1of1ForFork2_#t~ite79_1|, ~z$w_buff1~0=v_~z$w_buff1~0_176, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_246, P3Thread1of1ForFork2_#t~ite85=|v_P3Thread1of1ForFork2_#t~ite85_1|, P3Thread1of1ForFork2_#t~ite84=|v_P3Thread1of1ForFork2_#t~ite84_1|, P3Thread1of1ForFork2_#t~ite86=|v_P3Thread1of1ForFork2_#t~ite86_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_563, ~z$w_buff0~0=v_~z$w_buff0~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_426, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_492, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_71, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_639, ~z~0=v_~z~0_213, P3Thread1of1ForFork2_#t~ite81=|v_P3Thread1of1ForFork2_#t~ite81_2|, P3Thread1of1ForFork2_#t~ite80=|v_P3Thread1of1ForFork2_#t~ite80_1|, ~x~0=v_~x~0_245, P3Thread1of1ForFork2_#t~ite83=|v_P3Thread1of1ForFork2_#t~ite83_1|, P3Thread1of1ForFork2_#t~ite82=|v_P3Thread1of1ForFork2_#t~ite82_1|} AuxVars[|v_P3_#t~ite81_41|, |v_P3_#t~ite75_35|] AssignedVars[P3Thread1of1ForFork2_#t~ite85, P3Thread1of1ForFork2_#t~ite84, P3Thread1of1ForFork2_#t~ite76, P3Thread1of1ForFork2_#t~ite75, P3Thread1of1ForFork2_#t~ite86, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite78, P3Thread1of1ForFork2_#t~ite77, ~z$w_buff0_used~0, P3Thread1of1ForFork2_#t~ite79, ~z$w_buff1_used~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z~0, P3Thread1of1ForFork2_#t~ite81, P3Thread1of1ForFork2_#t~ite80, ~x~0, P3Thread1of1ForFork2_#t~ite83, P3Thread1of1ForFork2_#t~ite82][58], [259#(and (= ~x$r_buff1_thd4~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0)), Black: 191#(<= ~__unbuffered_cnt~0 1), Black: 203#(<= ~__unbuffered_cnt~0 2), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 22#L774true, 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, Black: 213#(= ~a~0 1), 161#true, Black: 225#(<= ~__unbuffered_cnt~0 3), Black: 163#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 39#L903true, Black: 164#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd0~0 0)), 233#true, 114#L852true, 116#L927-1true, 118#L827true, Black: 244#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0) (= ~z~0 ~x$w_buff0~0)), Black: 246#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0) (= ~z~0 ~x$w_buff0~0)), Black: 248#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0)), Black: 236#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0)), Black: 237#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (or (= ~__unbuffered_p3_EAX~0 0) (not (= ~__unbuffered_p3_EAX~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0)), 190#(= ~__unbuffered_cnt~0 0), Black: 238#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (or (= ~__unbuffered_p3_EAX~0 0) (not (= ~__unbuffered_p3_EAX~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0))]) [2021-03-26 10:01:58,666 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 10:01:58,667 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:01:58,667 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:01:58,667 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:01:58,699 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2426] L891-->L903: Formula: (let ((.cse24 (= 0 (mod v_~x$w_buff0_used~0_640 256))) (.cse10 (= (mod v_~x$r_buff1_thd4~0_62 256) 0)) (.cse26 (= (mod v_~x$w_buff1_used~0_493 256) 0)) (.cse25 (= (mod v_~x$r_buff0_thd4~0_72 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_639 256) 0)) (.cse21 (= (mod v_~z$w_buff0_used~0_563 256) 0)) (.cse28 (= (mod v_~z$w_buff1_used~0_427 256) 0)) (.cse23 (= (mod v_~z$r_buff1_thd4~0_183 256) 0)) (.cse27 (= (mod v_~z$r_buff0_thd4~0_247 256) 0)) (.cse29 (= (mod v_~z$w_buff0_used~0_564 256) 0))) (let ((.cse0 (or .cse27 .cse29)) (.cse1 (not .cse29)) (.cse13 (or .cse28 .cse23)) (.cse15 (not .cse28)) (.cse16 (or .cse27 .cse21)) (.cse2 (not .cse27)) (.cse9 (not .cse11)) (.cse12 (or .cse11 .cse25)) (.cse17 (not .cse21)) (.cse14 (not .cse23)) (.cse18 (not .cse26)) (.cse6 (not .cse10)) (.cse19 (or .cse26 .cse10)) (.cse3 (or .cse24 .cse25)) (.cse4 (not .cse25)) (.cse5 (not .cse24))) (and (or (and (= v_~z$w_buff0_used~0_564 v_~z$w_buff0_used~0_563) .cse0) (and .cse1 .cse2 (= v_~z$w_buff0_used~0_563 0))) (or (and .cse3 (= v_~x$w_buff0_used~0_640 v_~x$w_buff0_used~0_639)) (and .cse4 (= v_~x$w_buff0_used~0_639 0) .cse5)) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_492 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd4~0_71 256) 0))) (or (and (= v_~x$r_buff1_thd4~0_61 0) (or (and .cse6 (not .cse7)) (and (not .cse8) .cse9))) (and (or .cse7 .cse10) (= v_~x$r_buff1_thd4~0_62 v_~x$r_buff1_thd4~0_61) (or .cse8 .cse11)))) (or (and .cse4 .cse9 (= v_~x$r_buff0_thd4~0_71 0)) (and .cse12 (= v_~x$r_buff0_thd4~0_72 v_~x$r_buff0_thd4~0_71))) (or (and (= |v_P3_#t~ite81_41| v_~z~0_213) .cse0 (or (and .cse13 (= |v_P3_#t~ite81_41| v_~z~0_214)) (and .cse14 (= |v_P3_#t~ite81_41| v_~z$w_buff1~0_176) .cse15))) (and (= v_~z$w_buff0~0_161 v_~z~0_213) .cse1 .cse2 (= |v_P3_#t~ite81_41| |v_P3Thread1of1ForFork2_#t~ite81_1|))) (or (and (= v_~z$w_buff1_used~0_427 v_~z$w_buff1_used~0_426) .cse13 .cse16) (and (or (and .cse2 .cse17) (and .cse14 .cse15)) (= v_~z$w_buff1_used~0_426 0))) (or (and .cse16 (= v_~z$r_buff0_thd4~0_247 v_~z$r_buff0_thd4~0_246)) (and .cse2 .cse17 (= v_~z$r_buff0_thd4~0_246 0))) (or (and (or (and .cse18 .cse6) (and .cse4 .cse9)) (= v_~x$w_buff1_used~0_492 0)) (and .cse12 .cse19 (= v_~x$w_buff1_used~0_493 v_~x$w_buff1_used~0_492))) (let ((.cse20 (= (mod v_~z$r_buff0_thd4~0_246 256) 0)) (.cse22 (= (mod v_~z$w_buff1_used~0_426 256) 0))) (or (and (or .cse20 .cse21) (or .cse22 .cse23) (= v_~z$r_buff1_thd4~0_182 v_~z$r_buff1_thd4~0_183)) (and (= v_~z$r_buff1_thd4~0_182 0) (or (and (not .cse20) .cse17) (and (not .cse22) .cse14))))) (or (and (or (and .cse18 .cse6 (= |v_P3_#t~ite75_35| v_~x$w_buff1~0_190)) (and (= |v_P3_#t~ite75_35| v_~x~0_246) .cse19)) .cse3 (= |v_P3_#t~ite75_35| v_~x~0_245)) (and (= |v_P3_#t~ite75_35| |v_P3Thread1of1ForFork2_#t~ite75_1|) .cse4 .cse5 (= v_~x$w_buff0~0_163 v_~x~0_245)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_163, P3Thread1of1ForFork2_#t~ite75=|v_P3Thread1of1ForFork2_#t~ite75_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_183, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_564, ~z$w_buff0~0=v_~z$w_buff0~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_427, ~z$w_buff1~0=v_~z$w_buff1~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_493, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_72, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_640, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_247, ~z~0=v_~z~0_214, P3Thread1of1ForFork2_#t~ite81=|v_P3Thread1of1ForFork2_#t~ite81_1|, ~x~0=v_~x~0_246} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_163, P3Thread1of1ForFork2_#t~ite76=|v_P3Thread1of1ForFork2_#t~ite76_1|, P3Thread1of1ForFork2_#t~ite75=|v_P3Thread1of1ForFork2_#t~ite75_2|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_182, P3Thread1of1ForFork2_#t~ite78=|v_P3Thread1of1ForFork2_#t~ite78_1|, P3Thread1of1ForFork2_#t~ite77=|v_P3Thread1of1ForFork2_#t~ite77_1|, P3Thread1of1ForFork2_#t~ite79=|v_P3Thread1of1ForFork2_#t~ite79_1|, ~z$w_buff1~0=v_~z$w_buff1~0_176, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_246, P3Thread1of1ForFork2_#t~ite85=|v_P3Thread1of1ForFork2_#t~ite85_1|, P3Thread1of1ForFork2_#t~ite84=|v_P3Thread1of1ForFork2_#t~ite84_1|, P3Thread1of1ForFork2_#t~ite86=|v_P3Thread1of1ForFork2_#t~ite86_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_563, ~z$w_buff0~0=v_~z$w_buff0~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_426, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_492, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_71, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_639, ~z~0=v_~z~0_213, P3Thread1of1ForFork2_#t~ite81=|v_P3Thread1of1ForFork2_#t~ite81_2|, P3Thread1of1ForFork2_#t~ite80=|v_P3Thread1of1ForFork2_#t~ite80_1|, ~x~0=v_~x~0_245, P3Thread1of1ForFork2_#t~ite83=|v_P3Thread1of1ForFork2_#t~ite83_1|, P3Thread1of1ForFork2_#t~ite82=|v_P3Thread1of1ForFork2_#t~ite82_1|} AuxVars[|v_P3_#t~ite81_41|, |v_P3_#t~ite75_35|] AssignedVars[P3Thread1of1ForFork2_#t~ite85, P3Thread1of1ForFork2_#t~ite84, P3Thread1of1ForFork2_#t~ite76, P3Thread1of1ForFork2_#t~ite75, P3Thread1of1ForFork2_#t~ite86, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite78, P3Thread1of1ForFork2_#t~ite77, ~z$w_buff0_used~0, P3Thread1of1ForFork2_#t~ite79, ~z$w_buff1_used~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z~0, P3Thread1of1ForFork2_#t~ite81, P3Thread1of1ForFork2_#t~ite80, ~x~0, P3Thread1of1ForFork2_#t~ite83, P3Thread1of1ForFork2_#t~ite82][58], [259#(and (= ~x$r_buff1_thd4~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0)), Black: 191#(<= ~__unbuffered_cnt~0 1), Black: 203#(<= ~__unbuffered_cnt~0 2), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, 89#L781true, Black: 213#(= ~a~0 1), 161#true, Black: 225#(<= ~__unbuffered_cnt~0 3), Black: 163#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 164#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd0~0 0)), 39#L903true, 233#true, 114#L852true, 116#L927-1true, 118#L827true, Black: 244#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0) (= ~z~0 ~x$w_buff0~0)), Black: 246#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0) (= ~z~0 ~x$w_buff0~0)), Black: 248#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0)), Black: 236#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0)), Black: 237#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (or (= ~__unbuffered_p3_EAX~0 0) (not (= ~__unbuffered_p3_EAX~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0)), 190#(= ~__unbuffered_cnt~0 0), Black: 238#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (or (= ~__unbuffered_p3_EAX~0 0) (not (= ~__unbuffered_p3_EAX~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0))]) [2021-03-26 10:01:58,699 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 10:01:58,699 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 10:01:58,699 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 10:01:58,699 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 10:01:58,827 INFO L129 PetriNetUnfolder]: 1107/2270 cut-off events. [2021-03-26 10:01:58,827 INFO L130 PetriNetUnfolder]: For 5112/5731 co-relation queries the response was YES. [2021-03-26 10:01:58,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7332 conditions, 2270 events. 1107/2270 cut-off events. For 5112/5731 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 17560 event pairs, 114 based on Foata normal form. 215/2285 useless extension candidates. Maximal degree in co-relation 7306. Up to 653 conditions per place. [2021-03-26 10:01:58,849 INFO L132 encePairwiseOnDemand]: 240/250 looper letters, 22 selfloop transitions, 25 changer transitions 2/87 dead transitions. [2021-03-26 10:01:58,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 599 flow [2021-03-26 10:01:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1179 transitions. [2021-03-26 10:01:58,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.786 [2021-03-26 10:01:58,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1179 transitions. [2021-03-26 10:01:58,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1179 transitions. [2021-03-26 10:01:58,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:58,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1179 transitions. [2021-03-26 10:01:58,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 196.5) internal successors, (1179), 6 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have 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:01:58,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have 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:01:58,875 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have 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:01:58,875 INFO L185 Difference]: Start difference. First operand has 66 places, 68 transitions, 400 flow. Second operand 6 states and 1179 transitions. [2021-03-26 10:01:58,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 599 flow [2021-03-26 10:01:58,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 591 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 10:01:58,923 INFO L241 Difference]: Finished difference. Result has 74 places, 78 transitions, 559 flow [2021-03-26 10:01:58,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2021-03-26 10:01:58,923 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2021-03-26 10:01:58,923 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:58,923 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 78 transitions, 559 flow [2021-03-26 10:01:58,923 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 78 transitions, 559 flow [2021-03-26 10:01:58,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 559 flow [2021-03-26 10:01:59,152 INFO L129 PetriNetUnfolder]: 958/2050 cut-off events. [2021-03-26 10:01:59,152 INFO L130 PetriNetUnfolder]: For 4116/4396 co-relation queries the response was YES. [2021-03-26 10:01:59,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6852 conditions, 2050 events. 958/2050 cut-off events. For 4116/4396 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 16557 event pairs, 124 based on Foata normal form. 86/1931 useless extension candidates. Maximal degree in co-relation 6823. Up to 609 conditions per place. [2021-03-26 10:01:59,192 INFO L142 LiptonReduction]: Number of co-enabled transitions 1248 [2021-03-26 10:01:59,355 INFO L154 LiptonReduction]: Checked pairs total: 417 [2021-03-26 10:01:59,355 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:59,355 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 432 [2021-03-26 10:01:59,355 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 559 flow [2021-03-26 10:01:59,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 193.14285714285714) internal successors, (1352), 7 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have 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:01:59,356 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:59,356 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:59,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:01:59,356 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1222172434, now seen corresponding path program 2 times [2021-03-26 10:01:59,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:59,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594181327] [2021-03-26 10:01:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:59,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:59,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:59,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:59,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:59,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:59,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:59,454 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:01:59,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594181327] [2021-03-26 10:01:59,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:59,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:59,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521964595] [2021-03-26 10:01:59,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:59,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:59,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 250 [2021-03-26 10:01:59,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 559 flow. Second operand has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:59,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:59,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 250 [2021-03-26 10:01:59,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:59,703 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2426] L891-->L903: Formula: (let ((.cse24 (= 0 (mod v_~x$w_buff0_used~0_640 256))) (.cse10 (= (mod v_~x$r_buff1_thd4~0_62 256) 0)) (.cse26 (= (mod v_~x$w_buff1_used~0_493 256) 0)) (.cse25 (= (mod v_~x$r_buff0_thd4~0_72 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_639 256) 0)) (.cse21 (= (mod v_~z$w_buff0_used~0_563 256) 0)) (.cse28 (= (mod v_~z$w_buff1_used~0_427 256) 0)) (.cse23 (= (mod v_~z$r_buff1_thd4~0_183 256) 0)) (.cse27 (= (mod v_~z$r_buff0_thd4~0_247 256) 0)) (.cse29 (= (mod v_~z$w_buff0_used~0_564 256) 0))) (let ((.cse0 (or .cse27 .cse29)) (.cse1 (not .cse29)) (.cse13 (or .cse28 .cse23)) (.cse15 (not .cse28)) (.cse16 (or .cse27 .cse21)) (.cse2 (not .cse27)) (.cse9 (not .cse11)) (.cse12 (or .cse11 .cse25)) (.cse17 (not .cse21)) (.cse14 (not .cse23)) (.cse18 (not .cse26)) (.cse6 (not .cse10)) (.cse19 (or .cse26 .cse10)) (.cse3 (or .cse24 .cse25)) (.cse4 (not .cse25)) (.cse5 (not .cse24))) (and (or (and (= v_~z$w_buff0_used~0_564 v_~z$w_buff0_used~0_563) .cse0) (and .cse1 .cse2 (= v_~z$w_buff0_used~0_563 0))) (or (and .cse3 (= v_~x$w_buff0_used~0_640 v_~x$w_buff0_used~0_639)) (and .cse4 (= v_~x$w_buff0_used~0_639 0) .cse5)) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_492 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd4~0_71 256) 0))) (or (and (= v_~x$r_buff1_thd4~0_61 0) (or (and .cse6 (not .cse7)) (and (not .cse8) .cse9))) (and (or .cse7 .cse10) (= v_~x$r_buff1_thd4~0_62 v_~x$r_buff1_thd4~0_61) (or .cse8 .cse11)))) (or (and .cse4 .cse9 (= v_~x$r_buff0_thd4~0_71 0)) (and .cse12 (= v_~x$r_buff0_thd4~0_72 v_~x$r_buff0_thd4~0_71))) (or (and (= |v_P3_#t~ite81_41| v_~z~0_213) .cse0 (or (and .cse13 (= |v_P3_#t~ite81_41| v_~z~0_214)) (and .cse14 (= |v_P3_#t~ite81_41| v_~z$w_buff1~0_176) .cse15))) (and (= v_~z$w_buff0~0_161 v_~z~0_213) .cse1 .cse2 (= |v_P3_#t~ite81_41| |v_P3Thread1of1ForFork2_#t~ite81_1|))) (or (and (= v_~z$w_buff1_used~0_427 v_~z$w_buff1_used~0_426) .cse13 .cse16) (and (or (and .cse2 .cse17) (and .cse14 .cse15)) (= v_~z$w_buff1_used~0_426 0))) (or (and .cse16 (= v_~z$r_buff0_thd4~0_247 v_~z$r_buff0_thd4~0_246)) (and .cse2 .cse17 (= v_~z$r_buff0_thd4~0_246 0))) (or (and (or (and .cse18 .cse6) (and .cse4 .cse9)) (= v_~x$w_buff1_used~0_492 0)) (and .cse12 .cse19 (= v_~x$w_buff1_used~0_493 v_~x$w_buff1_used~0_492))) (let ((.cse20 (= (mod v_~z$r_buff0_thd4~0_246 256) 0)) (.cse22 (= (mod v_~z$w_buff1_used~0_426 256) 0))) (or (and (or .cse20 .cse21) (or .cse22 .cse23) (= v_~z$r_buff1_thd4~0_182 v_~z$r_buff1_thd4~0_183)) (and (= v_~z$r_buff1_thd4~0_182 0) (or (and (not .cse20) .cse17) (and (not .cse22) .cse14))))) (or (and (or (and .cse18 .cse6 (= |v_P3_#t~ite75_35| v_~x$w_buff1~0_190)) (and (= |v_P3_#t~ite75_35| v_~x~0_246) .cse19)) .cse3 (= |v_P3_#t~ite75_35| v_~x~0_245)) (and (= |v_P3_#t~ite75_35| |v_P3Thread1of1ForFork2_#t~ite75_1|) .cse4 .cse5 (= v_~x$w_buff0~0_163 v_~x~0_245)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_163, P3Thread1of1ForFork2_#t~ite75=|v_P3Thread1of1ForFork2_#t~ite75_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_183, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_564, ~z$w_buff0~0=v_~z$w_buff0~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_427, ~z$w_buff1~0=v_~z$w_buff1~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_493, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_72, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_640, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_247, ~z~0=v_~z~0_214, P3Thread1of1ForFork2_#t~ite81=|v_P3Thread1of1ForFork2_#t~ite81_1|, ~x~0=v_~x~0_246} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_163, P3Thread1of1ForFork2_#t~ite76=|v_P3Thread1of1ForFork2_#t~ite76_1|, P3Thread1of1ForFork2_#t~ite75=|v_P3Thread1of1ForFork2_#t~ite75_2|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_182, P3Thread1of1ForFork2_#t~ite78=|v_P3Thread1of1ForFork2_#t~ite78_1|, P3Thread1of1ForFork2_#t~ite77=|v_P3Thread1of1ForFork2_#t~ite77_1|, P3Thread1of1ForFork2_#t~ite79=|v_P3Thread1of1ForFork2_#t~ite79_1|, ~z$w_buff1~0=v_~z$w_buff1~0_176, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_246, P3Thread1of1ForFork2_#t~ite85=|v_P3Thread1of1ForFork2_#t~ite85_1|, P3Thread1of1ForFork2_#t~ite84=|v_P3Thread1of1ForFork2_#t~ite84_1|, P3Thread1of1ForFork2_#t~ite86=|v_P3Thread1of1ForFork2_#t~ite86_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_563, ~z$w_buff0~0=v_~z$w_buff0~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_426, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_492, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_71, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_639, ~z~0=v_~z~0_213, P3Thread1of1ForFork2_#t~ite81=|v_P3Thread1of1ForFork2_#t~ite81_2|, P3Thread1of1ForFork2_#t~ite80=|v_P3Thread1of1ForFork2_#t~ite80_1|, ~x~0=v_~x~0_245, P3Thread1of1ForFork2_#t~ite83=|v_P3Thread1of1ForFork2_#t~ite83_1|, P3Thread1of1ForFork2_#t~ite82=|v_P3Thread1of1ForFork2_#t~ite82_1|} AuxVars[|v_P3_#t~ite81_41|, |v_P3_#t~ite75_35|] AssignedVars[P3Thread1of1ForFork2_#t~ite85, P3Thread1of1ForFork2_#t~ite84, P3Thread1of1ForFork2_#t~ite76, P3Thread1of1ForFork2_#t~ite75, P3Thread1of1ForFork2_#t~ite86, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite78, P3Thread1of1ForFork2_#t~ite77, ~z$w_buff0_used~0, P3Thread1of1ForFork2_#t~ite79, ~z$w_buff1_used~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z~0, P3Thread1of1ForFork2_#t~ite81, P3Thread1of1ForFork2_#t~ite80, ~x~0, P3Thread1of1ForFork2_#t~ite83, P3Thread1of1ForFork2_#t~ite82][54], [259#(and (= ~x$r_buff1_thd4~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0)), Black: 191#(<= ~__unbuffered_cnt~0 1), Black: 260#(and (= ~x$r_buff1_thd4~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (not (= ~x~0 ~x$w_buff0~0))), Black: 264#(and (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$r_buff0_thd4~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0)), 271#(= ~y~0 1), Black: 203#(<= ~__unbuffered_cnt~0 2), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, 89#L781true, Black: 213#(= ~a~0 1), 161#true, 37#L817true, Black: 163#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 225#(<= ~__unbuffered_cnt~0 3), Black: 164#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd0~0 0)), 39#L903true, 233#true, 114#L852true, 116#L927-1true, Black: 244#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0) (= ~z~0 ~x$w_buff0~0)), Black: 246#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0) (= ~z~0 ~x$w_buff0~0)), Black: 248#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0)), Black: 236#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0) (= ~z~0 ~x$w_buff1~0)), Black: 237#(and (= ~x$r_buff1_thd4~0 0) (= 0 ~x$r_buff0_thd3~0) (or (= ~__unbuffered_p3_EAX~0 0) (not (= ~__unbuffered_p3_EAX~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0)), 190#(= ~__unbuffered_cnt~0 0), Black: 238#(and (= ~x$r_buff1_thd4~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (or (= ~__unbuffered_p3_EAX~0 0) (not (= ~__unbuffered_p3_EAX~0 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd0~0 0))]) [2021-03-26 10:01:59,704 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-26 10:01:59,704 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 10:01:59,704 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 10:01:59,704 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 10:01:59,873 INFO L129 PetriNetUnfolder]: 1618/3365 cut-off events. [2021-03-26 10:01:59,873 INFO L130 PetriNetUnfolder]: For 7505/8156 co-relation queries the response was YES. [2021-03-26 10:01:59,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10991 conditions, 3365 events. 1618/3365 cut-off events. For 7505/8156 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 29155 event pairs, 244 based on Foata normal form. 153/3098 useless extension candidates. Maximal degree in co-relation 10960. Up to 1073 conditions per place. [2021-03-26 10:01:59,902 INFO L132 encePairwiseOnDemand]: 247/250 looper letters, 3 selfloop transitions, 2 changer transitions 10/79 dead transitions. [2021-03-26 10:01:59,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 571 flow [2021-03-26 10:01:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:01:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:01:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 882 transitions. [2021-03-26 10:01:59,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.882 [2021-03-26 10:01:59,908 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 882 transitions. [2021-03-26 10:01:59,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 882 transitions. [2021-03-26 10:01:59,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:59,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 882 transitions. [2021-03-26 10:01:59,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:59,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have 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:01:59,912 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have 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:01:59,912 INFO L185 Difference]: Start difference. First operand has 73 places, 78 transitions, 559 flow. Second operand 4 states and 882 transitions. [2021-03-26 10:01:59,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 571 flow [2021-03-26 10:02:00,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 562 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-26 10:02:00,109 INFO L241 Difference]: Finished difference. Result has 76 places, 69 transitions, 482 flow [2021-03-26 10:02:00,109 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2021-03-26 10:02:00,109 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, 6 predicate places. [2021-03-26 10:02:00,109 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:02:00,109 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 482 flow [2021-03-26 10:02:00,110 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 482 flow [2021-03-26 10:02:00,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 482 flow [2021-03-26 10:02:00,397 INFO L129 PetriNetUnfolder]: 1455/3028 cut-off events. [2021-03-26 10:02:00,397 INFO L130 PetriNetUnfolder]: For 5062/5475 co-relation queries the response was YES. [2021-03-26 10:02:00,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9818 conditions, 3028 events. 1455/3028 cut-off events. For 5062/5475 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 26462 event pairs, 209 based on Foata normal form. 78/2728 useless extension candidates. Maximal degree in co-relation 9788. Up to 981 conditions per place. [2021-03-26 10:02:00,444 INFO L142 LiptonReduction]: Number of co-enabled transitions 1022 [2021-03-26 10:02:00,481 INFO L154 LiptonReduction]: Checked pairs total: 81 [2021-03-26 10:02:00,481 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:02:00,481 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 372 [2021-03-26 10:02:00,482 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 482 flow [2021-03-26 10:02:00,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:02:00,482 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:02:00,482 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:02:00,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:02:00,483 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:02:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:02:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -753550792, now seen corresponding path program 3 times [2021-03-26 10:02:00,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:02:00,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919000989] [2021-03-26 10:02:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:02:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:02:00,556 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:02:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:02:00,665 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:02:00,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:02:00,722 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:02:00,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:02:00,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:02:00 BasicIcfg [2021-03-26 10:02:00,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:02:00,857 INFO L168 Benchmark]: Toolchain (without parser) took 107170.34 ms. Allocated memory was 255.9 MB in the beginning and 899.7 MB in the end (delta: 643.8 MB). Free memory was 233.4 MB in the beginning and 458.8 MB in the end (delta: -225.4 MB). Peak memory consumption was 419.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:00,857 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:02:00,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.71 ms. Allocated memory was 255.9 MB in the beginning and 373.3 MB in the end (delta: 117.4 MB). Free memory was 233.4 MB in the beginning and 325.5 MB in the end (delta: -92.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:00,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.44 ms. Allocated memory is still 373.3 MB. Free memory was 325.5 MB in the beginning and 320.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:00,858 INFO L168 Benchmark]: Boogie Preprocessor took 47.34 ms. Allocated memory is still 373.3 MB. Free memory was 320.9 MB in the beginning and 316.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:00,858 INFO L168 Benchmark]: RCFGBuilder took 4115.36 ms. Allocated memory was 373.3 MB in the beginning and 448.8 MB in the end (delta: 75.5 MB). Free memory was 316.7 MB in the beginning and 324.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 168.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:00,858 INFO L168 Benchmark]: TraceAbstraction took 102282.95 ms. Allocated memory was 448.8 MB in the beginning and 899.7 MB in the end (delta: 450.9 MB). Free memory was 323.4 MB in the beginning and 458.8 MB in the end (delta: -135.4 MB). Peak memory consumption was 316.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:02:00,859 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 658.71 ms. Allocated memory was 255.9 MB in the beginning and 373.3 MB in the end (delta: 117.4 MB). Free memory was 233.4 MB in the beginning and 325.5 MB in the end (delta: -92.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.44 ms. Allocated memory is still 373.3 MB. Free memory was 325.5 MB in the beginning and 320.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.34 ms. Allocated memory is still 373.3 MB. Free memory was 320.9 MB in the beginning and 316.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 4115.36 ms. Allocated memory was 373.3 MB in the beginning and 448.8 MB in the end (delta: 75.5 MB). Free memory was 316.7 MB in the beginning and 324.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 168.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 102282.95 ms. Allocated memory was 448.8 MB in the beginning and 899.7 MB in the end (delta: 450.9 MB). Free memory was 323.4 MB in the beginning and 458.8 MB in the end (delta: -135.4 MB). Peak memory consumption was 316.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21315.7ms, 145 PlacesBefore, 70 PlacesAfterwards, 134 TransitionsBefore, 58 TransitionsAfterwards, 2988 CoEnabledTransitionPairs, 5 FixpointIterations, 41 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 6284 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2637, positive: 2503, positive conditional: 2503, positive unconditional: 0, negative: 134, negative conditional: 134, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2637, positive: 2503, positive conditional: 0, positive unconditional: 2503, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2637, positive: 2503, positive conditional: 0, positive unconditional: 2503, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1893, positive: 1835, positive conditional: 0, positive unconditional: 1835, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1893, positive: 1831, positive conditional: 0, positive unconditional: 1831, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1643, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1632, negative conditional: 0, negative unconditional: 1632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2637, positive: 668, positive conditional: 0, positive unconditional: 668, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 1893, unknown conditional: 0, unknown unconditional: 1893] , Statistics on independence cache: Total cache size (in pairs): 1893, Positive cache size: 1835, Positive conditional cache size: 0, Positive unconditional cache size: 1835, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31905.0ms, 66 PlacesBefore, 48 PlacesAfterwards, 55 TransitionsBefore, 37 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 4 FixpointIterations, 14 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 3191 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 749, positive: 616, positive conditional: 616, positive unconditional: 0, negative: 133, negative conditional: 133, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 749, positive: 616, positive conditional: 18, positive unconditional: 598, negative: 133, negative conditional: 4, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 749, positive: 616, positive conditional: 18, positive unconditional: 598, negative: 133, negative conditional: 4, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 149, positive: 132, positive conditional: 4, positive unconditional: 128, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 149, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 606, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 595, negative conditional: 35, negative unconditional: 559, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 749, positive: 484, positive conditional: 14, positive unconditional: 470, negative: 116, negative conditional: 3, negative unconditional: 113, unknown: 149, unknown conditional: 5, unknown unconditional: 144] , Statistics on independence cache: Total cache size (in pairs): 2042, Positive cache size: 1967, Positive conditional cache size: 4, Positive unconditional cache size: 1963, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1628.2ms, 47 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 31 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1920 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 459, positive: 363, positive conditional: 363, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 459, positive: 363, positive conditional: 6, positive unconditional: 357, negative: 96, negative conditional: 3, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 459, positive: 363, positive conditional: 6, positive unconditional: 357, negative: 96, negative conditional: 3, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 78, negative conditional: 54, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 459, positive: 355, positive conditional: 6, positive unconditional: 349, negative: 94, negative conditional: 2, negative unconditional: 92, unknown: 10, unknown conditional: 1, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2052, Positive cache size: 1975, Positive conditional cache size: 4, Positive unconditional cache size: 1971, Negative cache size: 77, Negative conditional cache size: 2, Negative unconditional cache size: 75, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7557.1ms, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1056 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 287, positive: 241, positive conditional: 241, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 287, positive: 241, positive conditional: 25, positive unconditional: 216, negative: 46, negative conditional: 8, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 287, positive: 241, positive conditional: 25, positive unconditional: 216, negative: 46, negative conditional: 8, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 12, negative conditional: 5, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 12, negative conditional: 5, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 734, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 679, negative conditional: 330, negative unconditional: 349, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 287, positive: 204, positive conditional: 11, positive unconditional: 193, negative: 34, negative conditional: 3, negative unconditional: 31, unknown: 49, unknown conditional: 19, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 2101, Positive cache size: 2012, Positive conditional cache size: 18, Positive unconditional cache size: 1994, Negative cache size: 89, Negative conditional cache size: 7, Negative unconditional cache size: 82, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 305.0ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 572 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, positive: 129, positive conditional: 7, positive unconditional: 122, negative: 25, negative conditional: 5, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 129, positive conditional: 7, positive unconditional: 122, negative: 25, negative conditional: 5, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 253, negative conditional: 171, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 111, positive conditional: 4, positive unconditional: 107, negative: 21, negative conditional: 3, negative unconditional: 18, unknown: 22, unknown conditional: 5, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2030, Positive conditional cache size: 21, Positive unconditional cache size: 2009, Negative cache size: 93, Negative conditional cache size: 9, Negative unconditional cache size: 84, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.9ms, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 547 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, positive: 115, positive conditional: 6, positive unconditional: 109, negative: 24, negative conditional: 5, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, positive: 115, positive conditional: 6, positive unconditional: 109, negative: 24, negative conditional: 5, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, positive: 115, positive conditional: 6, positive unconditional: 109, negative: 23, negative conditional: 5, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2124, Positive cache size: 2030, Positive conditional cache size: 21, Positive unconditional cache size: 2009, Negative cache size: 94, Negative conditional cache size: 9, Negative unconditional cache size: 85, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.6ms, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1139 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 295, positive: 257, positive conditional: 257, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 295, positive: 257, positive conditional: 81, positive unconditional: 176, negative: 38, negative conditional: 4, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 295, positive: 257, positive conditional: 81, positive unconditional: 176, negative: 38, negative conditional: 4, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 10, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 295, positive: 241, positive conditional: 71, positive unconditional: 170, negative: 37, negative conditional: 3, negative unconditional: 34, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2141, Positive cache size: 2046, Positive conditional cache size: 31, Positive unconditional cache size: 2015, Negative cache size: 95, Negative conditional cache size: 10, Negative unconditional cache size: 85, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 511.7ms, 57 PlacesBefore, 57 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1334 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, positive: 242, positive conditional: 82, positive unconditional: 160, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, positive: 242, positive conditional: 82, positive unconditional: 160, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 450, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 450, negative conditional: 0, negative unconditional: 450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, positive: 239, positive conditional: 80, positive unconditional: 159, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2151, Positive cache size: 2049, Positive conditional cache size: 33, Positive unconditional cache size: 2016, Negative cache size: 102, Negative conditional cache size: 10, Negative unconditional cache size: 92, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 99.3ms, 60 PlacesBefore, 60 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1645 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 392, positive: 342, positive conditional: 342, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 392, positive: 342, positive conditional: 158, positive unconditional: 184, negative: 50, negative conditional: 3, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 392, positive: 342, positive conditional: 158, positive unconditional: 184, negative: 50, negative conditional: 3, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 19, positive unconditional: 0, 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: 20, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 59, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 392, positive: 323, positive conditional: 139, positive unconditional: 184, negative: 49, negative conditional: 3, negative unconditional: 46, unknown: 20, unknown conditional: 19, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2171, Positive cache size: 2068, Positive conditional cache size: 52, Positive unconditional cache size: 2016, Negative cache size: 103, Negative conditional cache size: 10, Negative unconditional cache size: 93, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 701.0ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 586 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, positive: 62, positive conditional: 13, positive unconditional: 49, negative: 20, negative conditional: 3, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 62, positive conditional: 13, positive unconditional: 49, negative: 20, negative conditional: 3, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 654, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 654, negative conditional: 130, negative unconditional: 524, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, positive: 62, positive conditional: 13, positive unconditional: 49, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2178, Positive cache size: 2068, Positive conditional cache size: 52, Positive unconditional cache size: 2016, Negative cache size: 110, Negative conditional cache size: 11, Negative unconditional cache size: 99, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28297.6ms, 66 PlacesBefore, 62 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1721 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, positive: 281, positive conditional: 281, positive unconditional: 0, negative: 63, negative conditional: 63, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, positive: 281, positive conditional: 98, positive unconditional: 183, negative: 63, negative conditional: 12, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, positive: 281, positive conditional: 98, positive unconditional: 183, negative: 63, negative conditional: 12, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 55, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 344, positive: 279, positive conditional: 96, positive unconditional: 183, negative: 62, negative conditional: 12, negative unconditional: 50, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2181, Positive cache size: 2070, Positive conditional cache size: 54, Positive unconditional cache size: 2016, Negative cache size: 111, Negative conditional cache size: 11, Negative unconditional cache size: 100, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 464.3ms, 67 PlacesBefore, 66 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 776 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, positive: 254, positive conditional: 254, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, positive: 254, positive conditional: 110, positive unconditional: 144, negative: 22, negative conditional: 4, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, positive: 254, positive conditional: 110, positive unconditional: 144, negative: 22, negative conditional: 4, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 30, positive conditional: 17, positive unconditional: 13, 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: 31, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, positive: 224, positive conditional: 93, positive unconditional: 131, negative: 21, negative conditional: 4, negative unconditional: 17, unknown: 31, unknown conditional: 17, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 2212, Positive cache size: 2100, Positive conditional cache size: 71, Positive unconditional cache size: 2029, Negative cache size: 112, Negative conditional cache size: 11, Negative unconditional cache size: 101, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 431.4ms, 74 PlacesBefore, 73 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 417 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, positive: 151, positive conditional: 59, positive unconditional: 92, negative: 15, negative conditional: 8, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 151, positive conditional: 59, positive unconditional: 92, negative: 15, negative conditional: 8, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, positive: 150, positive conditional: 58, positive unconditional: 92, negative: 13, negative conditional: 6, negative unconditional: 7, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2215, Positive cache size: 2101, Positive conditional cache size: 72, Positive unconditional cache size: 2029, Negative cache size: 114, Negative conditional cache size: 13, Negative unconditional cache size: 101, Eliminated conditions: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 371.7ms, 76 PlacesBefore, 76 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1022 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 81 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 48, positive conditional: 33, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 48, positive conditional: 33, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 51, positive: 48, positive conditional: 33, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2215, Positive cache size: 2101, Positive conditional cache size: 72, Positive unconditional cache size: 2029, Negative cache size: 114, Negative conditional cache size: 13, Negative unconditional cache size: 101, Eliminated conditions: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t629; [L921] FCALL, FORK 0 pthread_create(&t629, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L922] 0 pthread_t t630; [L923] FCALL, FORK 0 pthread_create(&t630, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L924] 0 pthread_t t631; [L925] FCALL, FORK 0 pthread_create(&t631, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L926] 0 pthread_t t632; [L927] FCALL, FORK 0 pthread_create(&t632, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L878] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L878] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L893] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L893] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L893] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L842] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L842] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L842] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L847] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L847] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L933] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L933] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L933] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L938] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L938] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L950] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L950] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L951] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L951] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L952] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L952] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L953] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L954] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L954] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L955] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 137 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 101968.3ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4825.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21429.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 55 SDslu, 24 SDs, 0 SdLazy, 393 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1231.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1394.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=12, InterpolantAutomatonStates: 64, 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: 64.4ms SsaConstructionTime, 830.6ms SatisfiabilityAnalysisTime, 1839.3ms InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...