/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/mix013_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:04:37,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:04:37,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:04:37,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:04:37,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:04:37,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:04:37,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:04:37,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:04:37,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:04:37,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:04:37,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:04:37,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:04:37,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:04:37,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:04:37,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:04:37,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:04:37,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:04:37,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:04:37,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:04:37,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:04:37,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:04:37,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:04:37,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:04:37,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:04:37,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:04:37,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:04:37,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:04:37,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:04:37,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:04:37,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:04:37,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:04:37,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:04:37,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:04:37,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:04:37,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:04:37,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:04:37,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:04:37,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:04:37,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:04:37,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:04:37,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:04:37,845 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:04:37,878 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:04:37,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:04:37,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:04:37,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:04:37,882 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:04:37,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:04:37,882 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:04:37,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:04:37,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:04:37,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:04:37,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:04:37,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:04:37,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:04:37,884 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:04:37,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:04:37,884 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:04:37,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:04:37,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:04:37,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:04:37,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:04:37,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:04:37,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:04:37,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:04:37,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:04:37,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:04:37,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:04:37,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:04:37,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:04:37,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:04:37,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:04:37,886 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:04:38,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:04:38,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:04:38,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:04:38,189 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:04:38,190 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:04:38,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013_power.opt.i [2021-03-26 00:04:38,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3064e6ab/5c0c68b657834c78a563f4951be4149b/FLAG078c989f2 [2021-03-26 00:04:38,807 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:04:38,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_power.opt.i [2021-03-26 00:04:38,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3064e6ab/5c0c68b657834c78a563f4951be4149b/FLAG078c989f2 [2021-03-26 00:04:39,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3064e6ab/5c0c68b657834c78a563f4951be4149b [2021-03-26 00:04:39,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:04:39,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:04:39,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:04:39,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:04:39,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:04:39,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ceee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39, skipping insertion in model container [2021-03-26 00:04:39,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:04:39,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:04:39,507 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_power.opt.i[950,963] [2021-03-26 00:04:39,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:04:39,646 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:04:39,660 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_power.opt.i[950,963] [2021-03-26 00:04:39,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:04:39,824 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:04:39,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39 WrapperNode [2021-03-26 00:04:39,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:04:39,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:04:39,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:04:39,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:04:39,833 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:04:39" (1/1) ... [2021-03-26 00:04:39,849 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:04:39" (1/1) ... [2021-03-26 00:04:39,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:04:39,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:04:39,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:04:39,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:04:39,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (1/1) ... [2021-03-26 00:04:39,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:04:39,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:04:39,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:04:39,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:04:39,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (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:04:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:04:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:04:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:04:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:04:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:04:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:04:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:04:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:04:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:04:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:04:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:04:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:04:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:04:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:04:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:04:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:04:39,989 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:04:42,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:04:42,030 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:04:42,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:04:42 BoogieIcfgContainer [2021-03-26 00:04:42,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:04:42,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:04:42,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:04:42,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:04:42,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:04:39" (1/3) ... [2021-03-26 00:04:42,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43606b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:04:42, skipping insertion in model container [2021-03-26 00:04:42,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:04:39" (2/3) ... [2021-03-26 00:04:42,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43606b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:04:42, skipping insertion in model container [2021-03-26 00:04:42,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:04:42" (3/3) ... [2021-03-26 00:04:42,038 INFO L111 eAbstractionObserver]: Analyzing ICFG mix013_power.opt.i [2021-03-26 00:04:42,044 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:04:42,048 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:04:42,048 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:04:42,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,160 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:04:42,171 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:04:42,187 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:04:42,214 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:04:42,214 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:04:42,214 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:04:42,214 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:04:42,215 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:04:42,215 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:04:42,215 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:04:42,215 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:04:42,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-26 00:04:42,282 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-26 00:04:42,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:42,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 00:04:42,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-26 00:04:42,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-26 00:04:42,297 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:42,308 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-26 00:04:42,310 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-26 00:04:42,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-26 00:04:42,383 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-26 00:04:42,387 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:42,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 00:04:42,392 INFO L142 LiptonReduction]: Number of co-enabled transitions 2510 [2021-03-26 00:04:43,759 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:04:44,167 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:04:44,314 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:04:45,620 INFO L154 LiptonReduction]: Checked pairs total: 4176 [2021-03-26 00:04:45,620 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 00:04:45,624 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3328 [2021-03-26 00:04:45,644 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-26 00:04:45,644 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:45,644 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:45,645 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:04:45,645 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:45,648 INFO L82 PathProgramCache]: Analyzing trace with hash -333288266, now seen corresponding path program 1 times [2021-03-26 00:04:45,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:45,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522601054] [2021-03-26 00:04:45,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:45,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:45,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:45,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:45,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:45,881 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:04:45,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522601054] [2021-03-26 00:04:45,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:45,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:04:45,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519756877] [2021-03-26 00:04:45,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:04:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:04:45,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:04:45,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 192 [2021-03-26 00:04:45,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:45,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:45,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 192 [2021-03-26 00:04:45,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:45,965 INFO L129 PetriNetUnfolder]: 13/76 cut-off events. [2021-03-26 00:04:45,966 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:45,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 76 events. 13/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 180 event pairs, 1 based on Foata normal form. 7/79 useless extension candidates. Maximal degree in co-relation 95. Up to 25 conditions per place. [2021-03-26 00:04:45,968 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 6 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2021-03-26 00:04:45,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 124 flow [2021-03-26 00:04:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:04:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:04:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2021-03-26 00:04:45,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201388888888888 [2021-03-26 00:04:45,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2021-03-26 00:04:45,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2021-03-26 00:04:45,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:45,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2021-03-26 00:04:45,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:46,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:46,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:46,009 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 530 transitions. [2021-03-26 00:04:46,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 124 flow [2021-03-26 00:04:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:04:46,014 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 00:04:46,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 00:04:46,016 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 00:04:46,017 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:46,017 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:04:46,018 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:04:46,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 00:04:46,028 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 00:04:46,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:46,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:04:46,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 546 [2021-03-26 00:04:47,581 INFO L154 LiptonReduction]: Checked pairs total: 2220 [2021-03-26 00:04:47,581 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 00:04:47,582 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1565 [2021-03-26 00:04:47,583 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 00:04:47,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:47,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:47,584 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:04:47,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:04:47,584 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 975759929, now seen corresponding path program 1 times [2021-03-26 00:04:47,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:47,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950999002] [2021-03-26 00:04:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:47,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:47,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:47,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:47,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:47,707 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:04:47,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:04:47,720 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:04:47,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:04:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:04:47,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950999002] [2021-03-26 00:04:47,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:47,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:04:47,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853298854] [2021-03-26 00:04:47,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:04:47,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:04:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:04:47,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2021-03-26 00:04:47,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have 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:04:47,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:47,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2021-03-26 00:04:47,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:47,887 INFO L129 PetriNetUnfolder]: 213/471 cut-off events. [2021-03-26 00:04:47,887 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:47,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 471 events. 213/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2684 event pairs, 67 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 806. Up to 141 conditions per place. [2021-03-26 00:04:47,894 INFO L132 encePairwiseOnDemand]: 198/207 looper letters, 10 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2021-03-26 00:04:47,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 172 flow [2021-03-26 00:04:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:04:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:04:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1050 transitions. [2021-03-26 00:04:47,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8454106280193237 [2021-03-26 00:04:47,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1050 transitions. [2021-03-26 00:04:47,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1050 transitions. [2021-03-26 00:04:47,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:47,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1050 transitions. [2021-03-26 00:04:47,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:47,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have 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:04:47,905 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have 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:04:47,905 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 6 states and 1050 transitions. [2021-03-26 00:04:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 172 flow [2021-03-26 00:04:47,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:04:47,906 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 84 flow [2021-03-26 00:04:47,907 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2021-03-26 00:04:47,907 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -14 predicate places. [2021-03-26 00:04:47,907 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:47,907 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 84 flow [2021-03-26 00:04:47,908 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 29 transitions, 84 flow [2021-03-26 00:04:47,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 84 flow [2021-03-26 00:04:47,921 INFO L129 PetriNetUnfolder]: 29/97 cut-off events. [2021-03-26 00:04:47,921 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:04:47,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 97 events. 29/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 393 event pairs, 29 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 154. Up to 53 conditions per place. [2021-03-26 00:04:47,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-26 00:04:48,132 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 00:04:48,627 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:04:48,784 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:04:49,115 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:04:49,278 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:04:49,301 INFO L154 LiptonReduction]: Checked pairs total: 285 [2021-03-26 00:04:49,302 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:04:49,302 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1395 [2021-03-26 00:04:49,303 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 78 flow [2021-03-26 00:04:49,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have 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:04:49,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:49,304 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:04:49,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:04:49,304 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -191339384, now seen corresponding path program 1 times [2021-03-26 00:04:49,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:49,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248258052] [2021-03-26 00:04:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:49,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:49,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:49,349 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:04:49,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248258052] [2021-03-26 00:04:49,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:49,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:04:49,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864276083] [2021-03-26 00:04:49,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:04:49,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:04:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:04:49,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 210 [2021-03-26 00:04:49,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:04:49,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:49,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 210 [2021-03-26 00:04:49,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:49,379 INFO L129 PetriNetUnfolder]: 29/98 cut-off events. [2021-03-26 00:04:49,379 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:04:49,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 98 events. 29/98 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 383 event pairs, 29 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 166. Up to 53 conditions per place. [2021-03-26 00:04:49,381 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-26 00:04:49,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 84 flow [2021-03-26 00:04:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:04:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:04:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2021-03-26 00:04:49,383 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9063492063492063 [2021-03-26 00:04:49,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2021-03-26 00:04:49,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2021-03-26 00:04:49,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:49,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2021-03-26 00:04:49,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have 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:04:49,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have 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:04:49,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have 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:04:49,387 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 78 flow. Second operand 3 states and 571 transitions. [2021-03-26 00:04:49,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 84 flow [2021-03-26 00:04:49,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 26 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:04:49,388 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 82 flow [2021-03-26 00:04:49,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-26 00:04:49,388 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places. [2021-03-26 00:04:49,388 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:49,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 82 flow [2021-03-26 00:04:49,389 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 82 flow [2021-03-26 00:04:49,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 82 flow [2021-03-26 00:04:49,404 INFO L129 PetriNetUnfolder]: 29/94 cut-off events. [2021-03-26 00:04:49,404 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 00:04:49,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 94 events. 29/94 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 29 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 169. Up to 53 conditions per place. [2021-03-26 00:04:49,406 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-26 00:04:49,408 INFO L154 LiptonReduction]: Checked pairs total: 80 [2021-03-26 00:04:49,408 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:04:49,408 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 00:04:49,413 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 82 flow [2021-03-26 00:04:49,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:04:49,414 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:49,414 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:04:49,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:04:49,414 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1681278597, now seen corresponding path program 1 times [2021-03-26 00:04:49,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:49,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250090343] [2021-03-26 00:04:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:49,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:49,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:49,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:49,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:49,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:49,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:49,551 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:04:49,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250090343] [2021-03-26 00:04:49,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:49,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:04:49,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516559233] [2021-03-26 00:04:49,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:04:49,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:04:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:04:49,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 210 [2021-03-26 00:04:49,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have 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:04:49,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:49,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 210 [2021-03-26 00:04:49,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:49,660 INFO L129 PetriNetUnfolder]: 349/699 cut-off events. [2021-03-26 00:04:49,660 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-03-26 00:04:49,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 699 events. 349/699 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4385 event pairs, 141 based on Foata normal form. 54/607 useless extension candidates. Maximal degree in co-relation 1439. Up to 492 conditions per place. [2021-03-26 00:04:49,666 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 12 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2021-03-26 00:04:49,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 154 flow [2021-03-26 00:04:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:04:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:04:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2021-03-26 00:04:49,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8609523809523809 [2021-03-26 00:04:49,670 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2021-03-26 00:04:49,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2021-03-26 00:04:49,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:49,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2021-03-26 00:04:49,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have 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:04:49,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have 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:04:49,675 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have 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:04:49,675 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 82 flow. Second operand 5 states and 904 transitions. [2021-03-26 00:04:49,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 154 flow [2021-03-26 00:04:49,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:04:49,678 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 153 flow [2021-03-26 00:04:49,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-03-26 00:04:49,679 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -16 predicate places. [2021-03-26 00:04:49,679 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:49,679 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 153 flow [2021-03-26 00:04:49,679 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 153 flow [2021-03-26 00:04:49,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 153 flow [2021-03-26 00:04:49,729 INFO L129 PetriNetUnfolder]: 255/548 cut-off events. [2021-03-26 00:04:49,730 INFO L130 PetriNetUnfolder]: For 321/390 co-relation queries the response was YES. [2021-03-26 00:04:49,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 548 events. 255/548 cut-off events. For 321/390 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3410 event pairs, 131 based on Foata normal form. 4/509 useless extension candidates. Maximal degree in co-relation 1518. Up to 365 conditions per place. [2021-03-26 00:04:49,738 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-26 00:04:49,883 INFO L154 LiptonReduction]: Checked pairs total: 125 [2021-03-26 00:04:49,883 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:04:49,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 204 [2021-03-26 00:04:49,885 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 147 flow [2021-03-26 00:04:49,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have 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:04:49,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:49,886 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:04:49,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:04:49,886 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash -747639019, now seen corresponding path program 1 times [2021-03-26 00:04:49,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:49,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719632899] [2021-03-26 00:04:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:50,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:04:50,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:50,024 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:04:50,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719632899] [2021-03-26 00:04:50,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:50,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:04:50,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048853995] [2021-03-26 00:04:50,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:04:50,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:50,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:04:50,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:04:50,030 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2021-03-26 00:04:50,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:04:50,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:50,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2021-03-26 00:04:50,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:50,256 INFO L129 PetriNetUnfolder]: 636/1129 cut-off events. [2021-03-26 00:04:50,256 INFO L130 PetriNetUnfolder]: For 775/856 co-relation queries the response was YES. [2021-03-26 00:04:50,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1129 events. 636/1129 cut-off events. For 775/856 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6576 event pairs, 135 based on Foata normal form. 112/1185 useless extension candidates. Maximal degree in co-relation 3554. Up to 550 conditions per place. [2021-03-26 00:04:50,267 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 28 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2021-03-26 00:04:50,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 348 flow [2021-03-26 00:04:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:04:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:04:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1203 transitions. [2021-03-26 00:04:50,270 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8183673469387756 [2021-03-26 00:04:50,270 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1203 transitions. [2021-03-26 00:04:50,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1203 transitions. [2021-03-26 00:04:50,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:50,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1203 transitions. [2021-03-26 00:04:50,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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:04:50,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have 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:04:50,277 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have 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:04:50,277 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 147 flow. Second operand 7 states and 1203 transitions. [2021-03-26 00:04:50,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 348 flow [2021-03-26 00:04:50,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 338 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:04:50,285 INFO L241 Difference]: Finished difference. Result has 51 places, 43 transitions, 268 flow [2021-03-26 00:04:50,285 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2021-03-26 00:04:50,285 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2021-03-26 00:04:50,285 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:50,285 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 268 flow [2021-03-26 00:04:50,285 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 268 flow [2021-03-26 00:04:50,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 268 flow [2021-03-26 00:04:50,373 INFO L129 PetriNetUnfolder]: 194/459 cut-off events. [2021-03-26 00:04:50,373 INFO L130 PetriNetUnfolder]: For 1028/1256 co-relation queries the response was YES. [2021-03-26 00:04:50,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 459 events. 194/459 cut-off events. For 1028/1256 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2794 event pairs, 53 based on Foata normal form. 14/449 useless extension candidates. Maximal degree in co-relation 1836. Up to 328 conditions per place. [2021-03-26 00:04:50,382 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-26 00:04:50,463 INFO L154 LiptonReduction]: Checked pairs total: 55 [2021-03-26 00:04:50,463 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:04:50,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 179 [2021-03-26 00:04:50,467 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 260 flow [2021-03-26 00:04:50,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:04:50,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:50,468 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:04:50,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:04:50,468 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash -124320276, now seen corresponding path program 1 times [2021-03-26 00:04:50,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:50,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143473829] [2021-03-26 00:04:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:50,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:50,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,555 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:04:50,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143473829] [2021-03-26 00:04:50,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:50,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:04:50,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341074008] [2021-03-26 00:04:50,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:04:50,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:04:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:04:50,557 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 210 [2021-03-26 00:04:50,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have 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:04:50,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:50,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 210 [2021-03-26 00:04:50,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:50,679 INFO L129 PetriNetUnfolder]: 320/682 cut-off events. [2021-03-26 00:04:50,679 INFO L130 PetriNetUnfolder]: For 1676/2427 co-relation queries the response was YES. [2021-03-26 00:04:50,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2509 conditions, 682 events. 320/682 cut-off events. For 1676/2427 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4100 event pairs, 126 based on Foata normal form. 41/650 useless extension candidates. Maximal degree in co-relation 2490. Up to 373 conditions per place. [2021-03-26 00:04:50,687 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 3 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-26 00:04:50,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 234 flow [2021-03-26 00:04:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:04:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:04:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 730 transitions. [2021-03-26 00:04:50,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2021-03-26 00:04:50,690 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 730 transitions. [2021-03-26 00:04:50,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 730 transitions. [2021-03-26 00:04:50,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:50,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 730 transitions. [2021-03-26 00:04:50,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have 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:04:50,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:50,694 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:50,694 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 260 flow. Second operand 4 states and 730 transitions. [2021-03-26 00:04:50,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 234 flow [2021-03-26 00:04:50,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 193 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:04:50,701 INFO L241 Difference]: Finished difference. Result has 50 places, 39 transitions, 194 flow [2021-03-26 00:04:50,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2021-03-26 00:04:50,702 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2021-03-26 00:04:50,702 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:50,702 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 194 flow [2021-03-26 00:04:50,702 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 194 flow [2021-03-26 00:04:50,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 194 flow [2021-03-26 00:04:50,787 INFO L129 PetriNetUnfolder]: 313/674 cut-off events. [2021-03-26 00:04:50,787 INFO L130 PetriNetUnfolder]: For 740/809 co-relation queries the response was YES. [2021-03-26 00:04:50,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 674 events. 313/674 cut-off events. For 740/809 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4168 event pairs, 127 based on Foata normal form. 10/632 useless extension candidates. Maximal degree in co-relation 1988. Up to 319 conditions per place. [2021-03-26 00:04:50,797 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 00:04:50,843 INFO L154 LiptonReduction]: Checked pairs total: 20 [2021-03-26 00:04:50,843 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:04:50,843 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 141 [2021-03-26 00:04:50,844 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 194 flow [2021-03-26 00:04:50,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have 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:04:50,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:50,845 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:04:50,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:04:50,845 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash -340681018, now seen corresponding path program 1 times [2021-03-26 00:04:50,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:50,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019716302] [2021-03-26 00:04:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:50,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:50,994 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:04:50,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:04:50,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:50,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:51,005 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:04:51,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019716302] [2021-03-26 00:04:51,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:51,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:04:51,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575163728] [2021-03-26 00:04:51,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:04:51,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:04:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:04:51,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 210 [2021-03-26 00:04:51,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:51,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:51,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 210 [2021-03-26 00:04:51,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:51,185 INFO L129 PetriNetUnfolder]: 450/911 cut-off events. [2021-03-26 00:04:51,185 INFO L130 PetriNetUnfolder]: For 1201/1616 co-relation queries the response was YES. [2021-03-26 00:04:51,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2995 conditions, 911 events. 450/911 cut-off events. For 1201/1616 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5825 event pairs, 123 based on Foata normal form. 181/998 useless extension candidates. Maximal degree in co-relation 2977. Up to 393 conditions per place. [2021-03-26 00:04:51,194 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 10 selfloop transitions, 21 changer transitions 4/55 dead transitions. [2021-03-26 00:04:51,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 372 flow [2021-03-26 00:04:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:04:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:04:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1266 transitions. [2021-03-26 00:04:51,198 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612244897959184 [2021-03-26 00:04:51,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1266 transitions. [2021-03-26 00:04:51,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1266 transitions. [2021-03-26 00:04:51,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:51,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1266 transitions. [2021-03-26 00:04:51,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have 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:04:51,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have 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:04:51,205 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have 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:04:51,205 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 194 flow. Second operand 7 states and 1266 transitions. [2021-03-26 00:04:51,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 372 flow [2021-03-26 00:04:51,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:04:51,211 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 337 flow [2021-03-26 00:04:51,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2021-03-26 00:04:51,211 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2021-03-26 00:04:51,211 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:51,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 337 flow [2021-03-26 00:04:51,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 337 flow [2021-03-26 00:04:51,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 337 flow [2021-03-26 00:04:51,264 INFO L129 PetriNetUnfolder]: 191/472 cut-off events. [2021-03-26 00:04:51,265 INFO L130 PetriNetUnfolder]: For 971/1027 co-relation queries the response was YES. [2021-03-26 00:04:51,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 472 events. 191/472 cut-off events. For 971/1027 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3022 event pairs, 47 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1896. Up to 288 conditions per place. [2021-03-26 00:04:51,273 INFO L142 LiptonReduction]: Number of co-enabled transitions 596 [2021-03-26 00:04:51,318 INFO L154 LiptonReduction]: Checked pairs total: 152 [2021-03-26 00:04:51,318 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:04:51,318 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 00:04:51,319 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 327 flow [2021-03-26 00:04:51,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:51,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:51,319 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:04:51,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:04:51,320 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:51,320 INFO L82 PathProgramCache]: Analyzing trace with hash 448851144, now seen corresponding path program 1 times [2021-03-26 00:04:51,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:51,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899775667] [2021-03-26 00:04:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:51,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:51,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,386 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:04:51,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899775667] [2021-03-26 00:04:51,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:51,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:04:51,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365479877] [2021-03-26 00:04:51,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:04:51,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:51,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:04:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:04:51,389 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 210 [2021-03-26 00:04:51,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:04:51,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:51,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 210 [2021-03-26 00:04:51,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:51,537 INFO L129 PetriNetUnfolder]: 311/732 cut-off events. [2021-03-26 00:04:51,537 INFO L130 PetriNetUnfolder]: For 1357/1447 co-relation queries the response was YES. [2021-03-26 00:04:51,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 732 events. 311/732 cut-off events. For 1357/1447 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4725 event pairs, 127 based on Foata normal form. 7/695 useless extension candidates. Maximal degree in co-relation 2526. Up to 289 conditions per place. [2021-03-26 00:04:51,543 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-26 00:04:51,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 303 flow [2021-03-26 00:04:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:04:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:04:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2021-03-26 00:04:51,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8892857142857142 [2021-03-26 00:04:51,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2021-03-26 00:04:51,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2021-03-26 00:04:51,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:51,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2021-03-26 00:04:51,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have 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:04:51,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:51,550 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:51,550 INFO L185 Difference]: Start difference. First operand has 58 places, 47 transitions, 327 flow. Second operand 4 states and 747 transitions. [2021-03-26 00:04:51,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 303 flow [2021-03-26 00:04:51,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 256 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:04:51,558 INFO L241 Difference]: Finished difference. Result has 57 places, 44 transitions, 247 flow [2021-03-26 00:04:51,558 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2021-03-26 00:04:51,558 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 00:04:51,558 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:51,558 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 247 flow [2021-03-26 00:04:51,558 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 247 flow [2021-03-26 00:04:51,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 247 flow [2021-03-26 00:04:51,622 INFO L129 PetriNetUnfolder]: 267/622 cut-off events. [2021-03-26 00:04:51,622 INFO L130 PetriNetUnfolder]: For 770/790 co-relation queries the response was YES. [2021-03-26 00:04:51,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 622 events. 267/622 cut-off events. For 770/790 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3991 event pairs, 69 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 1941. Up to 249 conditions per place. [2021-03-26 00:04:51,633 INFO L142 LiptonReduction]: Number of co-enabled transitions 534 [2021-03-26 00:04:51,650 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-26 00:04:51,650 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:04:51,650 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-26 00:04:51,651 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 247 flow [2021-03-26 00:04:51,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:04:51,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:51,651 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:04:51,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:04:51,651 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2132913308, now seen corresponding path program 2 times [2021-03-26 00:04:51,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:51,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51596674] [2021-03-26 00:04:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:51,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,759 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:04:51,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:04:51,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:51,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:51,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:51,771 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:04:51,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51596674] [2021-03-26 00:04:51,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:51,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:04:51,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539636508] [2021-03-26 00:04:51,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:04:51,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:04:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:04:51,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 210 [2021-03-26 00:04:51,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have 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:04:51,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:51,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 210 [2021-03-26 00:04:51,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:51,991 INFO L129 PetriNetUnfolder]: 639/1275 cut-off events. [2021-03-26 00:04:51,991 INFO L130 PetriNetUnfolder]: For 1662/2041 co-relation queries the response was YES. [2021-03-26 00:04:51,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1275 events. 639/1275 cut-off events. For 1662/2041 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8720 event pairs, 177 based on Foata normal form. 215/1352 useless extension candidates. Maximal degree in co-relation 4192. Up to 363 conditions per place. [2021-03-26 00:04:52,001 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 6 selfloop transitions, 21 changer transitions 5/53 dead transitions. [2021-03-26 00:04:52,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 367 flow [2021-03-26 00:04:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:04:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:04:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1439 transitions. [2021-03-26 00:04:52,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.856547619047619 [2021-03-26 00:04:52,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1439 transitions. [2021-03-26 00:04:52,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1439 transitions. [2021-03-26 00:04:52,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:52,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1439 transitions. [2021-03-26 00:04:52,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.875) internal successors, (1439), 8 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have 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:04:52,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have 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:04:52,012 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have 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:04:52,012 INFO L185 Difference]: Start difference. First operand has 57 places, 44 transitions, 247 flow. Second operand 8 states and 1439 transitions. [2021-03-26 00:04:52,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 367 flow [2021-03-26 00:04:52,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 342 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 00:04:52,023 INFO L241 Difference]: Finished difference. Result has 64 places, 45 transitions, 296 flow [2021-03-26 00:04:52,023 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2021-03-26 00:04:52,023 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2021-03-26 00:04:52,023 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:52,023 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 45 transitions, 296 flow [2021-03-26 00:04:52,024 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 45 transitions, 296 flow [2021-03-26 00:04:52,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 45 transitions, 296 flow [2021-03-26 00:04:52,074 INFO L129 PetriNetUnfolder]: 235/547 cut-off events. [2021-03-26 00:04:52,074 INFO L130 PetriNetUnfolder]: For 1012/1100 co-relation queries the response was YES. [2021-03-26 00:04:52,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 547 events. 235/547 cut-off events. For 1012/1100 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3613 event pairs, 61 based on Foata normal form. 1/505 useless extension candidates. Maximal degree in co-relation 2056. Up to 215 conditions per place. [2021-03-26 00:04:52,083 INFO L142 LiptonReduction]: Number of co-enabled transitions 496 [2021-03-26 00:04:52,441 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:04:52,605 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:04:52,720 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-26 00:04:52,857 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-26 00:04:53,057 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-26 00:04:53,219 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-26 00:04:53,237 INFO L154 LiptonReduction]: Checked pairs total: 65 [2021-03-26 00:04:53,237 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:04:53,237 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1214 [2021-03-26 00:04:53,239 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 280 flow [2021-03-26 00:04:53,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have 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:04:53,240 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:53,240 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:04:53,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:04:53,240 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2014089156, now seen corresponding path program 1 times [2021-03-26 00:04:53,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:53,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681868104] [2021-03-26 00:04:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:53,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:53,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:53,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:53,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:53,301 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:04:53,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:04:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:04:53,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681868104] [2021-03-26 00:04:53,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:53,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:04:53,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548839021] [2021-03-26 00:04:53,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:04:53,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:04:53,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:04:53,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 212 [2021-03-26 00:04:53,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have 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:04:53,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:53,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 212 [2021-03-26 00:04:53,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:53,496 INFO L129 PetriNetUnfolder]: 496/1070 cut-off events. [2021-03-26 00:04:53,496 INFO L130 PetriNetUnfolder]: For 2353/2752 co-relation queries the response was YES. [2021-03-26 00:04:53,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3865 conditions, 1070 events. 496/1070 cut-off events. For 2353/2752 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7496 event pairs, 75 based on Foata normal form. 34/1031 useless extension candidates. Maximal degree in co-relation 3841. Up to 326 conditions per place. [2021-03-26 00:04:53,506 INFO L132 encePairwiseOnDemand]: 203/212 looper letters, 14 selfloop transitions, 13 changer transitions 1/59 dead transitions. [2021-03-26 00:04:53,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 420 flow [2021-03-26 00:04:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:04:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:04:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 884 transitions. [2021-03-26 00:04:53,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8339622641509434 [2021-03-26 00:04:53,510 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 884 transitions. [2021-03-26 00:04:53,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 884 transitions. [2021-03-26 00:04:53,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:53,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 884 transitions. [2021-03-26 00:04:53,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:04:53,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have 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:04:53,514 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have 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:04:53,514 INFO L185 Difference]: Start difference. First operand has 60 places, 42 transitions, 280 flow. Second operand 5 states and 884 transitions. [2021-03-26 00:04:53,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 420 flow [2021-03-26 00:04:53,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 353 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 00:04:53,530 INFO L241 Difference]: Finished difference. Result has 59 places, 53 transitions, 334 flow [2021-03-26 00:04:53,530 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2021-03-26 00:04:53,531 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2021-03-26 00:04:53,531 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:53,531 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 334 flow [2021-03-26 00:04:53,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 334 flow [2021-03-26 00:04:53,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 334 flow [2021-03-26 00:04:53,622 INFO L129 PetriNetUnfolder]: 423/927 cut-off events. [2021-03-26 00:04:53,623 INFO L130 PetriNetUnfolder]: For 1445/1681 co-relation queries the response was YES. [2021-03-26 00:04:53,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 927 events. 423/927 cut-off events. For 1445/1681 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6688 event pairs, 48 based on Foata normal form. 31/901 useless extension candidates. Maximal degree in co-relation 2961. Up to 268 conditions per place. [2021-03-26 00:04:53,637 INFO L142 LiptonReduction]: Number of co-enabled transitions 642 [2021-03-26 00:04:54,456 WARN L205 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:04:54,756 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:04:56,021 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:04:56,620 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:04:57,613 WARN L205 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 171 [2021-03-26 00:04:57,866 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-26 00:04:59,114 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-26 00:04:59,659 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:04:59,863 INFO L154 LiptonReduction]: Checked pairs total: 156 [2021-03-26 00:04:59,863 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:04:59,863 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6332 [2021-03-26 00:04:59,864 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 336 flow [2021-03-26 00:04:59,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have 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:04:59,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:59,864 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:04:59,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:04:59,865 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 694485904, now seen corresponding path program 1 times [2021-03-26 00:04:59,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:59,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536769465] [2021-03-26 00:04:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:59,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:59,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:04:59,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:59,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:59,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:59,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:04:59,965 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:04:59,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536769465] [2021-03-26 00:04:59,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:59,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:04:59,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439083482] [2021-03-26 00:04:59,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:04:59,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:59,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:04:59,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:04:59,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 214 [2021-03-26 00:04:59,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:04:59,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:59,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 214 [2021-03-26 00:04:59,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:05:00,128 INFO L129 PetriNetUnfolder]: 578/1261 cut-off events. [2021-03-26 00:05:00,128 INFO L130 PetriNetUnfolder]: For 2342/2870 co-relation queries the response was YES. [2021-03-26 00:05:00,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 1261 events. 578/1261 cut-off events. For 2342/2870 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9283 event pairs, 85 based on Foata normal form. 41/1212 useless extension candidates. Maximal degree in co-relation 4170. Up to 387 conditions per place. [2021-03-26 00:05:00,137 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 3 selfloop transitions, 1 changer transitions 16/53 dead transitions. [2021-03-26 00:05:00,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 350 flow [2021-03-26 00:05:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:05:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:05:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2021-03-26 00:05:00,140 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866822429906542 [2021-03-26 00:05:00,140 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2021-03-26 00:05:00,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2021-03-26 00:05:00,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:05:00,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2021-03-26 00:05:00,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have 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:05:00,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have 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:05:00,144 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have 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:05:00,144 INFO L185 Difference]: Start difference. First operand has 59 places, 53 transitions, 336 flow. Second operand 4 states and 759 transitions. [2021-03-26 00:05:00,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 350 flow [2021-03-26 00:05:00,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 334 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-03-26 00:05:00,164 INFO L241 Difference]: Finished difference. Result has 63 places, 37 transitions, 209 flow [2021-03-26 00:05:00,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2021-03-26 00:05:00,164 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2021-03-26 00:05:00,164 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:05:00,164 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 37 transitions, 209 flow [2021-03-26 00:05:00,164 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 37 transitions, 209 flow [2021-03-26 00:05:00,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 37 transitions, 209 flow [2021-03-26 00:05:00,182 INFO L129 PetriNetUnfolder]: 76/198 cut-off events. [2021-03-26 00:05:00,182 INFO L130 PetriNetUnfolder]: For 514/559 co-relation queries the response was YES. [2021-03-26 00:05:00,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 198 events. 76/198 cut-off events. For 514/559 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 974 event pairs, 15 based on Foata normal form. 15/196 useless extension candidates. Maximal degree in co-relation 613. Up to 60 conditions per place. [2021-03-26 00:05:00,185 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 00:05:00,804 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-26 00:05:00,939 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-26 00:05:02,257 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-03-26 00:05:02,538 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 00:05:02,638 INFO L154 LiptonReduction]: Checked pairs total: 111 [2021-03-26 00:05:02,638 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:05:02,638 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2474 [2021-03-26 00:05:02,639 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 35 transitions, 209 flow [2021-03-26 00:05:02,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:05:02,639 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:05:02,640 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:05:02,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:05:02,641 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:05:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:05:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1739207666, now seen corresponding path program 2 times [2021-03-26 00:05:02,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:05:02,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854536711] [2021-03-26 00:05:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:05:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:05:02,687 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:05:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:05:02,745 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:05:02,787 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:05:02,787 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:05:02,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:05:02,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:05:02 BasicIcfg [2021-03-26 00:05:02,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:05:02,902 INFO L168 Benchmark]: Toolchain (without parser) took 23632.47 ms. Allocated memory was 255.9 MB in the beginning and 721.4 MB in the end (delta: 465.6 MB). Free memory was 234.9 MB in the beginning and 630.4 MB in the end (delta: -395.5 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:05:02,902 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 162.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:05:02,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.81 ms. Allocated memory was 255.9 MB in the beginning and 381.7 MB in the end (delta: 125.8 MB). Free memory was 234.9 MB in the beginning and 339.4 MB in the end (delta: -104.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:05:02,903 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.75 ms. Allocated memory is still 381.7 MB. Free memory was 339.4 MB in the beginning and 336.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:05:02,903 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 ms. Allocated memory is still 381.7 MB. Free memory was 336.7 MB in the beginning and 333.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:05:02,904 INFO L168 Benchmark]: RCFGBuilder took 2106.83 ms. Allocated memory is still 381.7 MB. Free memory was 333.9 MB in the beginning and 186.8 MB in the end (delta: 147.1 MB). Peak memory consumption was 150.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:05:02,904 INFO L168 Benchmark]: TraceAbstraction took 20868.22 ms. Allocated memory was 381.7 MB in the beginning and 721.4 MB in the end (delta: 339.7 MB). Free memory was 185.7 MB in the beginning and 630.4 MB in the end (delta: -444.7 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:05:02,910 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.44 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 162.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 555.81 ms. Allocated memory was 255.9 MB in the beginning and 381.7 MB in the end (delta: 125.8 MB). Free memory was 234.9 MB in the beginning and 339.4 MB in the end (delta: -104.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.75 ms. Allocated memory is still 381.7 MB. Free memory was 339.4 MB in the beginning and 336.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.56 ms. Allocated memory is still 381.7 MB. Free memory was 336.7 MB in the beginning and 333.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2106.83 ms. Allocated memory is still 381.7 MB. Free memory was 333.9 MB in the beginning and 186.8 MB in the end (delta: 147.1 MB). Peak memory consumption was 150.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20868.22 ms. Allocated memory was 381.7 MB in the beginning and 721.4 MB in the end (delta: 339.7 MB). Free memory was 185.7 MB in the beginning and 630.4 MB in the end (delta: -444.7 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3309.6ms, 125 PlacesBefore, 61 PlacesAfterwards, 114 TransitionsBefore, 49 TransitionsAfterwards, 2510 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2575, positive: 2482, positive conditional: 2482, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1816, positive: 1777, positive conditional: 0, positive unconditional: 1777, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1816, positive: 1777, positive conditional: 0, positive unconditional: 1777, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1816, positive: 1765, positive conditional: 0, positive unconditional: 1765, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 460, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 424, negative conditional: 0, negative unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2575, positive: 705, positive conditional: 705, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 1816, unknown conditional: 1816, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 147, Positive conditional cache size: 147, 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: 1563.8ms, 57 PlacesBefore, 42 PlacesAfterwards, 46 TransitionsBefore, 31 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 2220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1023, positive: 913, positive conditional: 913, positive unconditional: 0, negative: 110, negative conditional: 110, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, positive: 193, positive conditional: 17, positive unconditional: 176, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 210, positive: 193, positive conditional: 17, positive unconditional: 176, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 210, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 226, negative conditional: 17, negative unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1023, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 210, unknown conditional: 210, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 241, Positive conditional cache size: 241, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1393.8ms, 47 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 134, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 19, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 19, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 213, Positive conditional cache size: 213, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8ms, 40 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 215, Positive conditional cache size: 215, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 203.9ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 125 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 22, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 22, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 218, Positive conditional cache size: 218, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 178.0ms, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 55 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 14, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 14, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 222, Positive conditional cache size: 222, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 140.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 228, Positive conditional cache size: 228, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.4ms, 58 PlacesBefore, 58 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 234, Positive conditional cache size: 234, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.5ms, 57 PlacesBefore, 57 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 7, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 7, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 26, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 244, Positive conditional cache size: 244, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1213.8ms, 64 PlacesBefore, 60 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 20, positive unconditional: 2, 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: 22, positive: 22, positive conditional: 20, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 62, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 239, Positive conditional cache size: 239, 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: 6332.1ms, 59 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 121, positive conditional: 121, 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: 68, positive: 64, positive conditional: 46, positive unconditional: 18, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 64, positive conditional: 46, positive unconditional: 18, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 64, positive conditional: 0, positive unconditional: 64, 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: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 222, negative conditional: 222, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 68, unknown conditional: 68, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 280, Positive conditional cache size: 280, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2473.6ms, 63 PlacesBefore, 58 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 97, positive conditional: 97, 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: 42, positive: 40, positive conditional: 27, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, positive: 40, positive conditional: 27, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L789] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L797] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L798] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L799] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L802] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L884] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20579.7ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1908.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3417.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 68 SDslu, 59 SDs, 0 SdLazy, 255 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 253.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 173.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=7, InterpolantAutomatonStates: 56, 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.0ms SsaConstructionTime, 487.7ms SatisfiabilityAnalysisTime, 693.1ms InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...