/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:22:18,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:22:18,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:22:18,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:22:18,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:22:18,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:22:18,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:22:18,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:22:18,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:22:18,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:22:18,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:22:18,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:22:18,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:22:18,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:22:18,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:22:18,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:22:18,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:22:18,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:22:18,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:22:18,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:22:18,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:22:18,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:22:18,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:22:18,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:22:18,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:22:18,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:22:18,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:22:18,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:22:18,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:22:18,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:22:18,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:22:18,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:22:18,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:22:18,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:22:18,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:22:18,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:22:18,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:22:18,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:22:18,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:22:18,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:22:18,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:22:18,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:22:18,753 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:22:18,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:22:18,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:22:18,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:22:18,756 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:22:18,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:22:18,757 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:22:18,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:22:18,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:22:18,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:22:18,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:22:18,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:22:18,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:22:18,758 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:22:18,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:22:18,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:22:18,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:22:18,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:22:18,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:22:18,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:22:18,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:22:18,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:22:18,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:22:18,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:22:18,761 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:22:19,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:22:19,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:22:19,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:22:19,047 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:22:19,048 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:22:19,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.oepc.i [2021-03-26 00:22:19,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f420ced91/091218567e094c57a79b4e0cb5f1d610/FLAGc2dea0148 [2021-03-26 00:22:19,643 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:22:19,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.oepc.i [2021-03-26 00:22:19,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f420ced91/091218567e094c57a79b4e0cb5f1d610/FLAGc2dea0148 [2021-03-26 00:22:19,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f420ced91/091218567e094c57a79b4e0cb5f1d610 [2021-03-26 00:22:19,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:22:19,950 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:22:19,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:22:19,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:22:19,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:22:19,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:22:19" (1/1) ... [2021-03-26 00:22:19,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddc562a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:19, skipping insertion in model container [2021-03-26 00:22:19,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:22:19" (1/1) ... [2021-03-26 00:22:19,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:22:20,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:22:20,116 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/mix051_pso.oepc.i[949,962] [2021-03-26 00:22:20,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:22:20,306 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:22:20,315 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/mix051_pso.oepc.i[949,962] [2021-03-26 00:22:20,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:22:20,435 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:22:20,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20 WrapperNode [2021-03-26 00:22:20,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:22:20,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:22:20,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:22:20,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:22:20,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:22:20,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:22:20,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:22:20,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:22:20,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... [2021-03-26 00:22:20,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:22:20,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:22:20,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:22:20,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:22:20,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:22:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:22:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:22:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:22:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:22:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:22:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:22:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:22:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:22:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:22:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:22:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:22:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:22:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:22:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:22:20,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:22:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:22:20,629 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:22:22,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:22:22,376 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:22:22,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:22:22 BoogieIcfgContainer [2021-03-26 00:22:22,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:22:22,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:22:22,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:22:22,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:22:22,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:22:19" (1/3) ... [2021-03-26 00:22:22,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e047c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:22:22, skipping insertion in model container [2021-03-26 00:22:22,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:22:20" (2/3) ... [2021-03-26 00:22:22,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e047c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:22:22, skipping insertion in model container [2021-03-26 00:22:22,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:22:22" (3/3) ... [2021-03-26 00:22:22,389 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_pso.oepc.i [2021-03-26 00:22:22,394 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:22:22,398 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:22:22,399 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:22:22,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,463 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,469 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,469 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,505 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:22:22,521 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:22:22,537 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:22:22,563 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:22:22,564 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:22:22,564 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:22:22,564 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:22:22,564 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:22:22,564 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:22:22,564 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:22:22,564 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:22:22,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-26 00:22:22,624 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-26 00:22:22,624 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:22,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:22:22,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-26 00:22:22,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-26 00:22:22,646 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:22,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-26 00:22:22,660 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-26 00:22:22,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-26 00:22:22,697 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-26 00:22:22,698 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:22,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:22:22,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-26 00:22:24,245 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:22:24,672 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:22:24,798 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:22:26,445 INFO L154 LiptonReduction]: Checked pairs total: 5017 [2021-03-26 00:22:26,445 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 00:22:26,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3802 [2021-03-26 00:22:26,457 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 00:22:26,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:26,457 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:26,458 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:26,458 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash 346426910, now seen corresponding path program 1 times [2021-03-26 00:22:26,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:26,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313773291] [2021-03-26 00:22:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:26,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:26,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:26,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:26,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:26,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313773291] [2021-03-26 00:22:26,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:26,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:22:26,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867726009] [2021-03-26 00:22:26,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:22:26,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:22:26,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:22:26,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2021-03-26 00:22:26,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:26,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:26,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2021-03-26 00:22:26,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:26,925 INFO L129 PetriNetUnfolder]: 133/297 cut-off events. [2021-03-26 00:22:26,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:26,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 297 events. 133/297 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1484 event pairs, 110 based on Foata normal form. 32/312 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-26 00:22:26,930 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 11 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2021-03-26 00:22:26,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 134 flow [2021-03-26 00:22:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:22:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:22:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 00:22:26,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175438596491228 [2021-03-26 00:22:26,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 00:22:26,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 00:22:26,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:26,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 00:22:26,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:26,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:26,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:26,970 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 523 transitions. [2021-03-26 00:22:26,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 134 flow [2021-03-26 00:22:26,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:22:26,977 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-26 00:22:26,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 00:22:26,979 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-26 00:22:26,979 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:26,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 00:22:26,980 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 00:22:26,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-26 00:22:26,986 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 00:22:26,986 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:26,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:22:26,988 INFO L142 LiptonReduction]: Number of co-enabled transitions 608 [2021-03-26 00:22:27,508 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:22:27,633 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:22:28,659 INFO L154 LiptonReduction]: Checked pairs total: 2496 [2021-03-26 00:22:28,659 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:22:28,659 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1680 [2021-03-26 00:22:28,661 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 00:22:28,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:28,661 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:28,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:28,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:22:28,662 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1849849399, now seen corresponding path program 1 times [2021-03-26 00:22:28,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:28,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167870798] [2021-03-26 00:22:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:28,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:28,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:28,752 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:22:28,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:22:28,768 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:22:28,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:22:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:28,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167870798] [2021-03-26 00:22:28,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:28,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:22:28,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783934466] [2021-03-26 00:22:28,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:22:28,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:22:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:22:28,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 202 [2021-03-26 00:22:28,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:28,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:28,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 202 [2021-03-26 00:22:28,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:28,872 INFO L129 PetriNetUnfolder]: 172/478 cut-off events. [2021-03-26 00:22:28,872 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:22:28,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 478 events. 172/478 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3055 event pairs, 36 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 766. Up to 132 conditions per place. [2021-03-26 00:22:28,875 INFO L132 encePairwiseOnDemand]: 194/202 looper letters, 7 selfloop transitions, 6 changer transitions 13/47 dead transitions. [2021-03-26 00:22:28,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 156 flow [2021-03-26 00:22:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:22:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:22:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2021-03-26 00:22:28,878 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8277227722772277 [2021-03-26 00:22:28,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 836 transitions. [2021-03-26 00:22:28,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 836 transitions. [2021-03-26 00:22:28,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:28,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 836 transitions. [2021-03-26 00:22:28,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:28,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:28,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:28,884 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 836 transitions. [2021-03-26 00:22:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 156 flow [2021-03-26 00:22:28,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:22:28,885 INFO L241 Difference]: Finished difference. Result has 48 places, 34 transitions, 122 flow [2021-03-26 00:22:28,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2021-03-26 00:22:28,886 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2021-03-26 00:22:28,886 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:28,886 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 34 transitions, 122 flow [2021-03-26 00:22:28,886 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 34 transitions, 122 flow [2021-03-26 00:22:28,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 122 flow [2021-03-26 00:22:28,914 INFO L129 PetriNetUnfolder]: 86/270 cut-off events. [2021-03-26 00:22:28,914 INFO L130 PetriNetUnfolder]: For 58/78 co-relation queries the response was YES. [2021-03-26 00:22:28,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 270 events. 86/270 cut-off events. For 58/78 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1531 event pairs, 24 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 556. Up to 131 conditions per place. [2021-03-26 00:22:28,918 INFO L142 LiptonReduction]: Number of co-enabled transitions 470 [2021-03-26 00:22:29,429 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:22:29,590 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:22:29,891 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:22:30,060 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:22:30,091 INFO L154 LiptonReduction]: Checked pairs total: 1215 [2021-03-26 00:22:30,091 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:22:30,091 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1205 [2021-03-26 00:22:30,093 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 118 flow [2021-03-26 00:22:30,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:30,094 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:30,094 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:30,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:22:30,094 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1156051992, now seen corresponding path program 1 times [2021-03-26 00:22:30,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:30,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894504272] [2021-03-26 00:22:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:30,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:30,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:30,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:30,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:22:30,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:30,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:30,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894504272] [2021-03-26 00:22:30,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:30,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:22:30,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070548942] [2021-03-26 00:22:30,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:22:30,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:22:30,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:22:30,190 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 00:22:30,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:30,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:30,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 00:22:30,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:30,389 INFO L129 PetriNetUnfolder]: 588/1178 cut-off events. [2021-03-26 00:22:30,389 INFO L130 PetriNetUnfolder]: For 99/131 co-relation queries the response was YES. [2021-03-26 00:22:30,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2462 conditions, 1178 events. 588/1178 cut-off events. For 99/131 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 8528 event pairs, 280 based on Foata normal form. 88/1147 useless extension candidates. Maximal degree in co-relation 2449. Up to 690 conditions per place. [2021-03-26 00:22:30,399 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-03-26 00:22:30,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 184 flow [2021-03-26 00:22:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:22:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:22:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-26 00:22:30,402 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8598039215686275 [2021-03-26 00:22:30,402 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-26 00:22:30,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-26 00:22:30,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:30,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-26 00:22:30,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:30,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:30,407 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:30,407 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 118 flow. Second operand 5 states and 877 transitions. [2021-03-26 00:22:30,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 184 flow [2021-03-26 00:22:30,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 162 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 00:22:30,412 INFO L241 Difference]: Finished difference. Result has 45 places, 41 transitions, 171 flow [2021-03-26 00:22:30,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2021-03-26 00:22:30,412 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -13 predicate places. [2021-03-26 00:22:30,413 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:30,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 171 flow [2021-03-26 00:22:30,414 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 171 flow [2021-03-26 00:22:30,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 171 flow [2021-03-26 00:22:30,505 INFO L129 PetriNetUnfolder]: 560/1138 cut-off events. [2021-03-26 00:22:30,505 INFO L130 PetriNetUnfolder]: For 519/823 co-relation queries the response was YES. [2021-03-26 00:22:30,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1138 events. 560/1138 cut-off events. For 519/823 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 8202 event pairs, 254 based on Foata normal form. 4/998 useless extension candidates. Maximal degree in co-relation 2959. Up to 729 conditions per place. [2021-03-26 00:22:30,520 INFO L142 LiptonReduction]: Number of co-enabled transitions 684 [2021-03-26 00:22:30,934 INFO L154 LiptonReduction]: Checked pairs total: 866 [2021-03-26 00:22:30,935 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:22:30,935 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 522 [2021-03-26 00:22:30,938 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 165 flow [2021-03-26 00:22:30,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:30,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:30,938 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:30,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:22:30,939 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:30,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:30,940 INFO L82 PathProgramCache]: Analyzing trace with hash -638440661, now seen corresponding path program 1 times [2021-03-26 00:22:30,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:30,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9834633] [2021-03-26 00:22:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:31,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:22:31,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:31,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9834633] [2021-03-26 00:22:31,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:31,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:22:31,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754607302] [2021-03-26 00:22:31,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:22:31,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:22:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:22:31,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 00:22:31,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:31,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 00:22:31,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:31,202 INFO L129 PetriNetUnfolder]: 335/769 cut-off events. [2021-03-26 00:22:31,202 INFO L130 PetriNetUnfolder]: For 608/857 co-relation queries the response was YES. [2021-03-26 00:22:31,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 769 events. 335/769 cut-off events. For 608/857 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5348 event pairs, 79 based on Foata normal form. 150/875 useless extension candidates. Maximal degree in co-relation 2513. Up to 505 conditions per place. [2021-03-26 00:22:31,210 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2021-03-26 00:22:31,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 265 flow [2021-03-26 00:22:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:22:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:22:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1052 transitions. [2021-03-26 00:22:31,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8594771241830066 [2021-03-26 00:22:31,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1052 transitions. [2021-03-26 00:22:31,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1052 transitions. [2021-03-26 00:22:31,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:31,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1052 transitions. [2021-03-26 00:22:31,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,219 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,219 INFO L185 Difference]: Start difference. First operand has 45 places, 40 transitions, 165 flow. Second operand 6 states and 1052 transitions. [2021-03-26 00:22:31,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 265 flow [2021-03-26 00:22:31,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 258 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:22:31,225 INFO L241 Difference]: Finished difference. Result has 49 places, 45 transitions, 254 flow [2021-03-26 00:22:31,226 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2021-03-26 00:22:31,226 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-26 00:22:31,226 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:31,226 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 254 flow [2021-03-26 00:22:31,226 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 254 flow [2021-03-26 00:22:31,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 254 flow [2021-03-26 00:22:31,297 INFO L129 PetriNetUnfolder]: 337/769 cut-off events. [2021-03-26 00:22:31,297 INFO L130 PetriNetUnfolder]: For 1787/2242 co-relation queries the response was YES. [2021-03-26 00:22:31,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 769 events. 337/769 cut-off events. For 1787/2242 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5308 event pairs, 81 based on Foata normal form. 21/741 useless extension candidates. Maximal degree in co-relation 2905. Up to 507 conditions per place. [2021-03-26 00:22:31,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 00:22:31,399 INFO L154 LiptonReduction]: Checked pairs total: 894 [2021-03-26 00:22:31,399 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:22:31,399 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 173 [2021-03-26 00:22:31,400 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 246 flow [2021-03-26 00:22:31,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:31,401 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:31,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:22:31,402 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1475912345, now seen corresponding path program 1 times [2021-03-26 00:22:31,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:31,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131751515] [2021-03-26 00:22:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:31,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:22:31,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:31,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131751515] [2021-03-26 00:22:31,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:31,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:22:31,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659326935] [2021-03-26 00:22:31,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:22:31,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:31,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:22:31,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:22:31,517 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 00:22:31,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:31,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 00:22:31,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:31,646 INFO L129 PetriNetUnfolder]: 166/433 cut-off events. [2021-03-26 00:22:31,646 INFO L130 PetriNetUnfolder]: For 1152/1470 co-relation queries the response was YES. [2021-03-26 00:22:31,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 433 events. 166/433 cut-off events. For 1152/1470 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2577 event pairs, 18 based on Foata normal form. 155/561 useless extension candidates. Maximal degree in co-relation 1850. Up to 288 conditions per place. [2021-03-26 00:22:31,650 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 6 selfloop transitions, 18 changer transitions 4/53 dead transitions. [2021-03-26 00:22:31,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 388 flow [2021-03-26 00:22:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:22:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:22:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1227 transitions. [2021-03-26 00:22:31,653 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8592436974789915 [2021-03-26 00:22:31,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1227 transitions. [2021-03-26 00:22:31,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1227 transitions. [2021-03-26 00:22:31,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:31,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1227 transitions. [2021-03-26 00:22:31,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.28571428571428) internal successors, (1227), 7 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,659 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,660 INFO L185 Difference]: Start difference. First operand has 49 places, 44 transitions, 246 flow. Second operand 7 states and 1227 transitions. [2021-03-26 00:22:31,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 388 flow [2021-03-26 00:22:31,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 326 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:22:31,666 INFO L241 Difference]: Finished difference. Result has 52 places, 49 transitions, 306 flow [2021-03-26 00:22:31,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2021-03-26 00:22:31,666 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2021-03-26 00:22:31,666 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:31,666 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 306 flow [2021-03-26 00:22:31,667 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 306 flow [2021-03-26 00:22:31,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 306 flow [2021-03-26 00:22:31,704 INFO L129 PetriNetUnfolder]: 160/425 cut-off events. [2021-03-26 00:22:31,704 INFO L130 PetriNetUnfolder]: For 765/796 co-relation queries the response was YES. [2021-03-26 00:22:31,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 425 events. 160/425 cut-off events. For 765/796 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2598 event pairs, 18 based on Foata normal form. 1/400 useless extension candidates. Maximal degree in co-relation 1569. Up to 248 conditions per place. [2021-03-26 00:22:31,709 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 00:22:31,848 INFO L154 LiptonReduction]: Checked pairs total: 1083 [2021-03-26 00:22:31,848 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:22:31,848 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182 [2021-03-26 00:22:31,850 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 296 flow [2021-03-26 00:22:31,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,851 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:31,851 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:31,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:22:31,851 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1973393136, now seen corresponding path program 1 times [2021-03-26 00:22:31,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:31,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913348493] [2021-03-26 00:22:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:31,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:31,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:31,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:31,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913348493] [2021-03-26 00:22:31,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:31,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:22:31,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866191507] [2021-03-26 00:22:31,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:22:31,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:31,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:22:31,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:22:31,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 204 [2021-03-26 00:22:31,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:31,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:31,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 204 [2021-03-26 00:22:31,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:32,037 INFO L129 PetriNetUnfolder]: 203/518 cut-off events. [2021-03-26 00:22:32,037 INFO L130 PetriNetUnfolder]: For 900/970 co-relation queries the response was YES. [2021-03-26 00:22:32,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 518 events. 203/518 cut-off events. For 900/970 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3183 event pairs, 24 based on Foata normal form. 8/491 useless extension candidates. Maximal degree in co-relation 1801. Up to 276 conditions per place. [2021-03-26 00:22:32,042 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 5 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2021-03-26 00:22:32,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 276 flow [2021-03-26 00:22:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:22:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:22:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2021-03-26 00:22:32,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615196078431373 [2021-03-26 00:22:32,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 703 transitions. [2021-03-26 00:22:32,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 703 transitions. [2021-03-26 00:22:32,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:32,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 703 transitions. [2021-03-26 00:22:32,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,047 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,047 INFO L185 Difference]: Start difference. First operand has 52 places, 48 transitions, 296 flow. Second operand 4 states and 703 transitions. [2021-03-26 00:22:32,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 276 flow [2021-03-26 00:22:32,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 235 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:22:32,056 INFO L241 Difference]: Finished difference. Result has 51 places, 46 transitions, 232 flow [2021-03-26 00:22:32,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2021-03-26 00:22:32,056 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2021-03-26 00:22:32,056 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:32,056 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 232 flow [2021-03-26 00:22:32,057 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 232 flow [2021-03-26 00:22:32,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 232 flow [2021-03-26 00:22:32,107 INFO L129 PetriNetUnfolder]: 203/517 cut-off events. [2021-03-26 00:22:32,107 INFO L130 PetriNetUnfolder]: For 554/561 co-relation queries the response was YES. [2021-03-26 00:22:32,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 517 events. 203/517 cut-off events. For 554/561 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3197 event pairs, 25 based on Foata normal form. 2/486 useless extension candidates. Maximal degree in co-relation 1474. Up to 198 conditions per place. [2021-03-26 00:22:32,114 INFO L142 LiptonReduction]: Number of co-enabled transitions 696 [2021-03-26 00:22:32,151 INFO L154 LiptonReduction]: Checked pairs total: 472 [2021-03-26 00:22:32,151 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:22:32,151 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-26 00:22:32,156 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 232 flow [2021-03-26 00:22:32,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:32,157 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:32,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:22:32,157 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:32,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1933071150, now seen corresponding path program 2 times [2021-03-26 00:22:32,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:32,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368232181] [2021-03-26 00:22:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:32,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:32,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:32,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:32,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:32,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:32,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:32,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:32,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:32,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:32,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:22:32,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:32,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:32,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368232181] [2021-03-26 00:22:32,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:32,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:22:32,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162563045] [2021-03-26 00:22:32,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:22:32,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:22:32,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:22:32,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 00:22:32,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:32,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 00:22:32,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:32,380 INFO L129 PetriNetUnfolder]: 179/455 cut-off events. [2021-03-26 00:22:32,380 INFO L130 PetriNetUnfolder]: For 638/850 co-relation queries the response was YES. [2021-03-26 00:22:32,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 455 events. 179/455 cut-off events. For 638/850 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2739 event pairs, 14 based on Foata normal form. 122/540 useless extension candidates. Maximal degree in co-relation 1589. Up to 179 conditions per place. [2021-03-26 00:22:32,384 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 2 selfloop transitions, 18 changer transitions 4/51 dead transitions. [2021-03-26 00:22:32,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 328 flow [2021-03-26 00:22:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:22:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:22:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1394 transitions. [2021-03-26 00:22:32,388 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2021-03-26 00:22:32,388 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1394 transitions. [2021-03-26 00:22:32,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1394 transitions. [2021-03-26 00:22:32,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:32,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1394 transitions. [2021-03-26 00:22:32,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 174.25) internal successors, (1394), 8 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,396 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:32,396 INFO L185 Difference]: Start difference. First operand has 51 places, 46 transitions, 232 flow. Second operand 8 states and 1394 transitions. [2021-03-26 00:22:32,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 328 flow [2021-03-26 00:22:32,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 311 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-03-26 00:22:32,401 INFO L241 Difference]: Finished difference. Result has 60 places, 47 transitions, 283 flow [2021-03-26 00:22:32,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2021-03-26 00:22:32,402 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2021-03-26 00:22:32,402 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:32,402 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 47 transitions, 283 flow [2021-03-26 00:22:32,402 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 47 transitions, 283 flow [2021-03-26 00:22:32,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 283 flow [2021-03-26 00:22:32,443 INFO L129 PetriNetUnfolder]: 167/439 cut-off events. [2021-03-26 00:22:32,443 INFO L130 PetriNetUnfolder]: For 703/758 co-relation queries the response was YES. [2021-03-26 00:22:32,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 439 events. 167/439 cut-off events. For 703/758 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2684 event pairs, 14 based on Foata normal form. 2/411 useless extension candidates. Maximal degree in co-relation 1523. Up to 163 conditions per place. [2021-03-26 00:22:32,449 INFO L142 LiptonReduction]: Number of co-enabled transitions 642 [2021-03-26 00:22:32,761 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:22:32,906 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:22:33,253 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:22:33,383 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:22:33,402 INFO L154 LiptonReduction]: Checked pairs total: 1204 [2021-03-26 00:22:33,402 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:22:33,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1000 [2021-03-26 00:22:33,403 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 267 flow [2021-03-26 00:22:33,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:33,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:33,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:33,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:22:33,404 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1634570733, now seen corresponding path program 1 times [2021-03-26 00:22:33,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:33,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959544219] [2021-03-26 00:22:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:33,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:33,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:22:33,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:33,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:22:33,455 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:22:33,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:22:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:33,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959544219] [2021-03-26 00:22:33,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:33,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:22:33,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638334105] [2021-03-26 00:22:33,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:22:33,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:22:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:22:33,465 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-26 00:22:33,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:33,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:33,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-26 00:22:33,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:33,557 INFO L129 PetriNetUnfolder]: 262/606 cut-off events. [2021-03-26 00:22:33,557 INFO L130 PetriNetUnfolder]: For 1392/1633 co-relation queries the response was YES. [2021-03-26 00:22:33,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 606 events. 262/606 cut-off events. For 1392/1633 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3869 event pairs, 2 based on Foata normal form. 40/600 useless extension candidates. Maximal degree in co-relation 2129. Up to 190 conditions per place. [2021-03-26 00:22:33,562 INFO L132 encePairwiseOnDemand]: 198/206 looper letters, 11 selfloop transitions, 16 changer transitions 3/59 dead transitions. [2021-03-26 00:22:33,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 401 flow [2021-03-26 00:22:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:22:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:22:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2021-03-26 00:22:33,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8135922330097087 [2021-03-26 00:22:33,565 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2021-03-26 00:22:33,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2021-03-26 00:22:33,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:33,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2021-03-26 00:22:33,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:33,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:33,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:33,569 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 267 flow. Second operand 5 states and 838 transitions. [2021-03-26 00:22:33,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 401 flow [2021-03-26 00:22:33,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 340 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 00:22:33,579 INFO L241 Difference]: Finished difference. Result has 55 places, 54 transitions, 322 flow [2021-03-26 00:22:33,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2021-03-26 00:22:33,579 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-26 00:22:33,579 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:33,579 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 322 flow [2021-03-26 00:22:33,580 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 322 flow [2021-03-26 00:22:33,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 322 flow [2021-03-26 00:22:33,632 INFO L129 PetriNetUnfolder]: 272/651 cut-off events. [2021-03-26 00:22:33,632 INFO L130 PetriNetUnfolder]: For 630/687 co-relation queries the response was YES. [2021-03-26 00:22:33,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 651 events. 272/651 cut-off events. For 630/687 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4452 event pairs, 6 based on Foata normal form. 17/619 useless extension candidates. Maximal degree in co-relation 1887. Up to 188 conditions per place. [2021-03-26 00:22:33,642 INFO L142 LiptonReduction]: Number of co-enabled transitions 786 [2021-03-26 00:22:34,014 INFO L154 LiptonReduction]: Checked pairs total: 714 [2021-03-26 00:22:34,014 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:22:34,015 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 436 [2021-03-26 00:22:34,015 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 322 flow [2021-03-26 00:22:34,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:34,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:34,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:34,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:22:34,042 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1322848317, now seen corresponding path program 1 times [2021-03-26 00:22:34,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:34,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813192355] [2021-03-26 00:22:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:22:34,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:34,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:22:34,231 INFO L142 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size [2021-03-26 00:22:34,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 00:22:34,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:34,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 00:22:34,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:34,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 00:22:34,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:22:34,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 00:22:34,360 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.8 percent of original size [2021-03-26 00:22:34,362 INFO L147 QuantifierPusher]: treesize reduction 9, result has 86.6 percent of original size 58 [2021-03-26 00:22:34,408 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:22:34,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:22:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:22:34,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813192355] [2021-03-26 00:22:34,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:22:34,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:22:34,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722977463] [2021-03-26 00:22:34,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 00:22:34,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:22:34,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 00:22:34,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-26 00:22:34,421 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 206 [2021-03-26 00:22:34,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 322 flow. Second operand has 9 states, 9 states have (on average 145.88888888888889) internal successors, (1313), 9 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:34,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:22:34,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 206 [2021-03-26 00:22:34,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:22:34,815 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1084] L821-->L837: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_362 256) 0)) (.cse19 (= (mod v_~a$r_buff0_thd4~0_236 256) 0)) (.cse28 (= 0 (mod v_~a$r_buff1_thd4~0_183 256)))) (let ((.cse8 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse11 (and .cse19 .cse28)) (.cse13 (and .cse31 .cse19)) (.cse30 (= (mod v_~a$w_buff0_used~0_490 256) 0)) (.cse4 (not .cse19)) (.cse27 (not .cse28)) (.cse18 (= (mod v_~a$w_buff1_used~0_361 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_489 256) 0))) (let ((.cse15 (or .cse12 .cse19)) (.cse17 (not .cse18)) (.cse14 (not .cse12)) (.cse1 (or .cse4 .cse27)) (.cse5 (or (not .cse31) .cse4)) (.cse3 (or .cse30 .cse19)) (.cse0 (not .cse30)) (.cse7 (or .cse30 .cse11 .cse13)) (.cse9 (not .cse8))) (and (= v_~a$flush_delayed~0_42 0) (let ((.cse6 (= |v_P3Thread1of1ForFork3_#t~ite27_1| |v_P3_#t~ite27_45|))) (or (and (or (and .cse0 (= |v_P3_#t~ite27_45| |v_P3_#t~ite28_41|) .cse1 (let ((.cse2 (= |v_P3_#t~ite27_45| v_~a$w_buff0~0_104))) (or (and .cse2 .cse3) (and .cse2 .cse0 .cse4))) .cse5) (and (= |v_P3_#t~ite28_41| v_~a$w_buff0~0_104) .cse6 .cse7)) .cse8 (= |v_P3_#t~ite28_41| v_~a$w_buff0~0_103)) (and .cse9 .cse6 (= |v_P3Thread1of1ForFork3_#t~ite28_1| |v_P3_#t~ite28_41|) (= v_~a$w_buff0~0_104 v_~a$w_buff0~0_103)))) (= v_~a~0_186 v_~a$mem_tmp~0_24) (or (and (= |v_P3_#t~ite25_41| |v_P3Thread1of1ForFork3_#t~ite25_1|) (= v_~a~0_186 v_~__unbuffered_p3_EAX~0_16) .cse7) (and (or (and .cse3 (= |v_P3_#t~ite25_41| v_~a$w_buff1~0_127)) (and (= |v_P3_#t~ite25_41| v_~a$w_buff0~0_104) .cse0 .cse4)) (= |v_P3_#t~ite25_41| v_~__unbuffered_p3_EAX~0_16) .cse0 .cse1 .cse5)) (let ((.cse10 (= |v_P3_#t~ite36_53| |v_P3Thread1of1ForFork3_#t~ite36_1|))) (or (and (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork3_#t~ite37_1|) .cse9 (= v_~a$w_buff1_used~0_361 v_~a$w_buff1_used~0_362) .cse10) (and .cse8 (or (and (or .cse11 .cse12 .cse13) .cse10 (= |v_P3_#t~ite37_49| v_~a$w_buff1_used~0_362)) (and .cse14 .cse1 .cse5 (= |v_P3_#t~ite36_53| |v_P3_#t~ite37_49|) (let ((.cse16 (= |v_P3_#t~ite36_53| 0))) (or (and .cse15 .cse16) (and .cse14 .cse4 .cse16))))) (= |v_P3_#t~ite37_49| v_~a$w_buff1_used~0_361)))) (or (and .cse8 (= v_~a~0_184 v_~__unbuffered_p3_EAX~0_16)) (and (= v_~a~0_184 v_~a$mem_tmp~0_24) .cse9)) (= |v_P3Thread1of1ForFork3_#t~nondet23_1| v_~weak$$choice0~0_13) (let ((.cse20 (= |v_P3_#t~ite39_49| |v_P3Thread1of1ForFork3_#t~ite39_1|))) (or (and .cse8 (= |v_P3_#t~ite40_39| v_~a$r_buff0_thd4~0_235) (or (and (= |v_P3_#t~ite39_49| |v_P3_#t~ite40_39|) .cse14 (or (and .cse15 (= |v_P3_#t~ite39_49| v_~a$r_buff0_thd4~0_236)) (and .cse14 (= |v_P3_#t~ite39_49| 0) .cse4)) (or .cse4 .cse17) .cse1) (and (or (and .cse18 .cse19) .cse11 .cse12) .cse20 (= |v_P3_#t~ite40_39| v_~a$r_buff0_thd4~0_236)))) (and (= v_~a$r_buff0_thd4~0_236 v_~a$r_buff0_thd4~0_235) .cse20 .cse9 (= |v_P3_#t~ite40_39| |v_P3Thread1of1ForFork3_#t~ite40_1|)))) (let ((.cse21 (= |v_P3_#t~ite30_61| |v_P3Thread1of1ForFork3_#t~ite30_1|))) (or (and .cse9 (= v_~a$w_buff1~0_127 v_~a$w_buff1~0_126) .cse21 (= |v_P3_#t~ite31_51| |v_P3Thread1of1ForFork3_#t~ite31_1|)) (and (= |v_P3_#t~ite31_51| v_~a$w_buff1~0_126) .cse8 (or (and .cse21 (= |v_P3_#t~ite31_51| v_~a$w_buff1~0_127) .cse7) (and .cse0 .cse1 .cse5 (= |v_P3_#t~ite30_61| |v_P3_#t~ite31_51|) (let ((.cse22 (= |v_P3_#t~ite30_61| v_~a$w_buff1~0_127))) (or (and .cse0 .cse22 .cse4) (and .cse3 .cse22)))))))) (let ((.cse23 (= |v_P3_#t~ite42_59| |v_P3Thread1of1ForFork3_#t~ite42_1|))) (or (and .cse9 .cse23 (= |v_P3_#t~ite43_55| |v_P3Thread1of1ForFork3_#t~ite43_1|) (= v_~a$r_buff1_thd4~0_183 v_~a$r_buff1_thd4~0_182)) (and (= |v_P3_#t~ite43_55| v_~a$r_buff1_thd4~0_182) .cse8 (let ((.cse26 (= (mod v_~a$r_buff0_thd4~0_235 256) 0))) (or (let ((.cse24 (not .cse26))) (and (or .cse24 .cse17) .cse14 (let ((.cse25 (= |v_P3_#t~ite42_59| 0))) (or (and .cse14 .cse24 .cse25) (and (or .cse26 .cse12) .cse25))) (or .cse27 .cse24) (= |v_P3_#t~ite42_59| |v_P3_#t~ite43_55|))) (and .cse23 (= |v_P3_#t~ite43_55| v_~a$r_buff1_thd4~0_183) (or (and .cse26 .cse28) .cse12 (and .cse26 .cse18)))))))) (= |v_P3Thread1of1ForFork3_#t~nondet24_1| v_~weak$$choice2~0_86) (let ((.cse29 (= |v_P3Thread1of1ForFork3_#t~ite33_1| |v_P3_#t~ite33_51|))) (or (and .cse8 (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_489) (or (and .cse0 .cse1 .cse5 (or (and (= |v_P3_#t~ite33_51| v_~a$w_buff0_used~0_490) .cse3) (and .cse0 .cse4 (= |v_P3_#t~ite33_51| 0))) (= |v_P3_#t~ite33_51| |v_P3_#t~ite34_45|)) (and (= |v_P3_#t~ite34_45| v_~a$w_buff0_used~0_490) .cse29 .cse7))) (and (= |v_P3_#t~ite34_45| |v_P3Thread1of1ForFork3_#t~ite34_1|) .cse9 (= v_~a$w_buff0_used~0_489 v_~a$w_buff0_used~0_490) .cse29))))))) InVars {P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_1|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_1|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_1|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_183, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_490, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_236, ~a~0=v_~a~0_186, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_1|, ~a$w_buff1~0=v_~a$w_buff1~0_127, ~a$w_buff0~0=v_~a$w_buff0~0_104, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_1|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_1|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_362, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_1|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_182, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_235, ~a~0=v_~a~0_184, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~a$w_buff1~0=v_~a$w_buff1~0_126, P3Thread1of1ForFork3_#t~ite39=|v_P3Thread1of1ForFork3_#t~ite39_2|, P3Thread1of1ForFork3_#t~ite38=|v_P3Thread1of1ForFork3_#t~ite38_1|, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_2|, P3Thread1of1ForFork3_#t~ite36=|v_P3Thread1of1ForFork3_#t~ite36_2|, P3Thread1of1ForFork3_#t~ite35=|v_P3Thread1of1ForFork3_#t~ite35_1|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, P3Thread1of1ForFork3_#t~ite34=|v_P3Thread1of1ForFork3_#t~ite34_2|, P3Thread1of1ForFork3_#t~ite33=|v_P3Thread1of1ForFork3_#t~ite33_2|, P3Thread1of1ForFork3_#t~ite32=|v_P3Thread1of1ForFork3_#t~ite32_1|, P3Thread1of1ForFork3_#t~ite31=|v_P3Thread1of1ForFork3_#t~ite31_2|, P3Thread1of1ForFork3_#t~ite30=|v_P3Thread1of1ForFork3_#t~ite30_2|, P3Thread1of1ForFork3_#t~nondet23=|v_P3Thread1of1ForFork3_#t~nondet23_2|, P3Thread1of1ForFork3_#t~nondet24=|v_P3Thread1of1ForFork3_#t~nondet24_2|, P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_2|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_2|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_1|, P3Thread1of1ForFork3_#t~ite45=|v_P3Thread1of1ForFork3_#t~ite45_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_489, ~weak$$choice0~0=v_~weak$$choice0~0_13, P3Thread1of1ForFork3_#t~ite29=|v_P3Thread1of1ForFork3_#t~ite29_1|, P3Thread1of1ForFork3_#t~ite28=|v_P3Thread1of1ForFork3_#t~ite28_2|, ~a$flush_delayed~0=v_~a$flush_delayed~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_103, P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_2|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_1|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_361, ~weak$$choice2~0=v_~weak$$choice2~0_86, P3Thread1of1ForFork3_#t~ite41=|v_P3Thread1of1ForFork3_#t~ite41_1|, P3Thread1of1ForFork3_#t~ite40=|v_P3Thread1of1ForFork3_#t~ite40_2|} AuxVars[|v_P3_#t~ite28_41|, |v_P3_#t~ite37_49|, |v_P3_#t~ite25_41|, |v_P3_#t~ite27_45|, |v_P3_#t~ite33_51|, |v_P3_#t~ite40_39|, |v_P3_#t~ite31_51|, |v_P3_#t~ite30_61|, |v_P3_#t~ite34_45|, |v_P3_#t~ite39_49|, |v_P3_#t~ite43_55|, |v_P3_#t~ite36_53|, |v_P3_#t~ite42_59|] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork3_#t~ite39, P3Thread1of1ForFork3_#t~ite38, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#t~ite36, P3Thread1of1ForFork3_#t~ite35, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork3_#t~ite34, P3Thread1of1ForFork3_#t~ite33, P3Thread1of1ForFork3_#t~ite32, P3Thread1of1ForFork3_#t~ite31, P3Thread1of1ForFork3_#t~ite30, P3Thread1of1ForFork3_#t~nondet23, P3Thread1of1ForFork3_#t~nondet24, P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, P3Thread1of1ForFork3_#t~ite45, ~a$w_buff0_used~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~ite41, P3Thread1of1ForFork3_#t~ite40][54], [P1Thread1of1ForFork1InUse, Black: 348#(= ~y~0 1), P3Thread1of1ForFork3InUse, Black: 382#(<= ~__unbuffered_cnt~0 3), 37#L868-1true, 422#(= ~z~0 1), Black: 163#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 524#(and (= ~a~0 ~__unbuffered_p3_EAX~0) (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd4~0 0) (<= ~a$w_buff0_used~0 0)), Black: 423#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 425#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 80#L811true, Black: 300#(<= ~__unbuffered_cnt~0 2), Black: 242#(<= ~__unbuffered_cnt~0 1), 87#L837true, 25#L784true, 57#L771true, 379#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 351#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1))]) [2021-03-26 00:22:34,815 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 00:22:34,815 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 00:22:34,815 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 00:22:34,815 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 00:22:34,991 INFO L129 PetriNetUnfolder]: 1454/3022 cut-off events. [2021-03-26 00:22:34,991 INFO L130 PetriNetUnfolder]: For 4204/4753 co-relation queries the response was YES. [2021-03-26 00:22:35,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8776 conditions, 3022 events. 1454/3022 cut-off events. For 4204/4753 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 25174 event pairs, 125 based on Foata normal form. 135/2871 useless extension candidates. Maximal degree in co-relation 8755. Up to 785 conditions per place. [2021-03-26 00:22:35,017 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 21 selfloop transitions, 8 changer transitions 4/77 dead transitions. [2021-03-26 00:22:35,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 496 flow [2021-03-26 00:22:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:22:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:22:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2021-03-26 00:22:35,021 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7249190938511327 [2021-03-26 00:22:35,021 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 896 transitions. [2021-03-26 00:22:35,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 896 transitions. [2021-03-26 00:22:35,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:22:35,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 896 transitions. [2021-03-26 00:22:35,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 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 00:22:35,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:35,026 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:35,026 INFO L185 Difference]: Start difference. First operand has 55 places, 54 transitions, 322 flow. Second operand 6 states and 896 transitions. [2021-03-26 00:22:35,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 496 flow [2021-03-26 00:22:35,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:22:35,158 INFO L241 Difference]: Finished difference. Result has 63 places, 60 transitions, 400 flow [2021-03-26 00:22:35,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2021-03-26 00:22:35,158 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2021-03-26 00:22:35,158 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:22:35,158 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 60 transitions, 400 flow [2021-03-26 00:22:35,159 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 60 transitions, 400 flow [2021-03-26 00:22:35,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 400 flow [2021-03-26 00:22:35,369 INFO L129 PetriNetUnfolder]: 921/2097 cut-off events. [2021-03-26 00:22:35,370 INFO L130 PetriNetUnfolder]: For 2301/2486 co-relation queries the response was YES. [2021-03-26 00:22:35,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6226 conditions, 2097 events. 921/2097 cut-off events. For 2301/2486 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 17831 event pairs, 82 based on Foata normal form. 39/1989 useless extension candidates. Maximal degree in co-relation 6202. Up to 647 conditions per place. [2021-03-26 00:22:35,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 968 [2021-03-26 00:22:35,725 INFO L154 LiptonReduction]: Checked pairs total: 149 [2021-03-26 00:22:35,725 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:22:35,725 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 567 [2021-03-26 00:22:35,726 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 400 flow [2021-03-26 00:22:35,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 145.88888888888889) internal successors, (1313), 9 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:22:35,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:22:35,727 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:22:35,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:22:35,728 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:22:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:22:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -37746553, now seen corresponding path program 2 times [2021-03-26 00:22:35,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:22:35,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383139987] [2021-03-26 00:22:35,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:22:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:22:35,790 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:22:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:22:35,870 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:22:35,912 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:22:35,913 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:22:35,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:22:36,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:22:36 BasicIcfg [2021-03-26 00:22:36,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:22:36,045 INFO L168 Benchmark]: Toolchain (without parser) took 16094.13 ms. Allocated memory was 255.9 MB in the beginning and 612.4 MB in the end (delta: 356.5 MB). Free memory was 234.5 MB in the beginning and 358.3 MB in the end (delta: -123.7 MB). Peak memory consumption was 231.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:22:36,045 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:22:36,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.52 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 234.5 MB in the beginning and 305.3 MB in the end (delta: -70.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:22:36,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.82 ms. Allocated memory is still 346.0 MB. Free memory was 305.3 MB in the beginning and 302.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:22:36,046 INFO L168 Benchmark]: Boogie Preprocessor took 46.56 ms. Allocated memory is still 346.0 MB. Free memory was 302.7 MB in the beginning and 300.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:22:36,046 INFO L168 Benchmark]: RCFGBuilder took 1829.22 ms. Allocated memory is still 346.0 MB. Free memory was 300.6 MB in the beginning and 176.8 MB in the end (delta: 123.8 MB). Peak memory consumption was 128.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:22:36,047 INFO L168 Benchmark]: TraceAbstraction took 13660.53 ms. Allocated memory was 346.0 MB in the beginning and 612.4 MB in the end (delta: 266.3 MB). Free memory was 175.8 MB in the beginning and 358.3 MB in the end (delta: -182.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:22:36,051 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 484.52 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 234.5 MB in the beginning and 305.3 MB in the end (delta: -70.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.82 ms. Allocated memory is still 346.0 MB. Free memory was 305.3 MB in the beginning and 302.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 46.56 ms. Allocated memory is still 346.0 MB. Free memory was 302.7 MB in the beginning and 300.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1829.22 ms. Allocated memory is still 346.0 MB. Free memory was 300.6 MB in the beginning and 176.8 MB in the end (delta: 123.8 MB). Peak memory consumption was 128.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13660.53 ms. Allocated memory was 346.0 MB in the beginning and 612.4 MB in the end (delta: 266.3 MB). Free memory was 175.8 MB in the beginning and 358.3 MB in the end (delta: -182.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3785.6ms, 123 PlacesBefore, 58 PlacesAfterwards, 112 TransitionsBefore, 46 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 5017 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2446, positive: 2329, positive conditional: 2329, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1715, positive: 1675, positive conditional: 0, positive unconditional: 1675, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1715, positive: 1675, positive conditional: 0, positive unconditional: 1675, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1715, positive: 1667, positive conditional: 0, positive unconditional: 1667, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 496, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 460, negative conditional: 0, negative unconditional: 460, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2446, positive: 654, positive conditional: 654, positive unconditional: 0, negative: 77, negative conditional: 77, negative unconditional: 0, unknown: 1715, unknown conditional: 1715, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 128, Positive conditional cache size: 128, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1678.8ms, 54 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 31 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2496 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 684, positive: 566, positive conditional: 566, positive unconditional: 0, negative: 118, negative conditional: 118, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, positive: 185, positive conditional: 22, positive unconditional: 163, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 217, positive: 185, positive conditional: 22, positive unconditional: 163, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 217, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 577, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 572, negative conditional: 91, negative unconditional: 481, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 684, positive: 381, positive conditional: 381, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 217, unknown conditional: 217, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 189, Positive conditional cache size: 189, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1205.1ms, 48 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 306, positive: 249, positive conditional: 249, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 8, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 8, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 306, positive: 219, positive conditional: 219, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 219, Positive conditional cache size: 219, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 521.2ms, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 74, positive conditional: 49, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 83, positive: 74, positive conditional: 49, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 83, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 226, positive: 122, positive conditional: 122, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 83, unknown conditional: 83, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 252, Positive conditional cache size: 252, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.9ms, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 204, positive: 176, positive conditional: 176, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 46, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 46, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 0, positive unconditional: 53, 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: 204, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 53, unknown conditional: 53, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 278, Positive conditional cache size: 278, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 181.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1083 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 212, positive: 178, positive conditional: 178, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 60, positive conditional: 38, positive unconditional: 22, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 60, positive conditional: 38, positive unconditional: 22, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, positive: 118, positive conditional: 118, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 64, unknown conditional: 64, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 309, Positive conditional cache size: 309, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.3ms, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 22, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 22, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 0, positive unconditional: 31, 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: 104, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 340, Positive conditional cache size: 340, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 999.8ms, 60 PlacesBefore, 56 PlacesAfterwards, 47 TransitionsBefore, 44 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 163, positive conditional: 163, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 30, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 30, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 0, positive unconditional: 31, 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: 208, positive: 132, positive conditional: 132, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 319, Positive conditional cache size: 319, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 434.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 714 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 338, positive: 316, positive conditional: 316, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 96, positive conditional: 76, positive unconditional: 20, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103, positive: 96, positive conditional: 76, positive unconditional: 20, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 96, positive conditional: 0, positive unconditional: 96, 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: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 302, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 302, negative conditional: 302, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 338, positive: 220, positive conditional: 220, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 103, unknown conditional: 103, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 415, Positive conditional cache size: 415, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 566.6ms, 63 PlacesBefore, 63 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 149 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 23, positive conditional: 23, 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: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 438, Positive conditional cache size: 438, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1361; [L862] FCALL, FORK 0 pthread_create(&t1361, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L863] 0 pthread_t t1362; [L864] FCALL, FORK 0 pthread_create(&t1362, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L865] 0 pthread_t t1363; [L866] FCALL, FORK 0 pthread_create(&t1363, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L867] 0 pthread_t t1364; [L868] FCALL, FORK 0 pthread_create(&t1364, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L828] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L829] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L830] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L832] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L833] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13354.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1945.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3889.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 35 SDslu, 31 SDs, 0 SdLazy, 310 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 305.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 336.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=9, InterpolantAutomatonStates: 49, 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: 42.1ms SsaConstructionTime, 425.9ms SatisfiabilityAnalysisTime, 827.6ms InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...