/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:21:58,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:21:58,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:21:58,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:21:58,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:21:58,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:21:58,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:21:58,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:21:58,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:21:58,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:21:58,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:21:58,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:21:58,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:21:58,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:21:58,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:21:58,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:21:58,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:21:58,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:21:58,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:21:58,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:21:58,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:21:58,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:21:58,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:21:58,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:21:58,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:21:58,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:21:58,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:21:58,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:21:58,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:21:58,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:21:58,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:21:58,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:21:58,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:21:58,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:21:58,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:21:58,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:21:58,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:21:58,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:21:58,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:21:58,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:21:58,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:21:58,696 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-RepeatedSemanticLbe.epf [2021-03-25 14:21:58,728 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:21:58,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:21:58,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:21:58,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:21:58,731 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:21:58,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:21:58,731 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:21:58,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:21:58,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:21:58,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:21:58,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:21:58,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:21:58,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:21:58,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:21:58,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:21:58,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:21:58,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:21:58,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:21:58,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:21:58,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:21:58,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:21:58,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:21:58,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:21:58,734 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-25 14:21:59,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:21:59,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:21:59,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:21:59,053 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:21:59,055 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:21:59,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_pso.opt.i [2021-03-25 14:21:59,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab18dcb1e/1dde3d2b95314fa4b06ccd824a2d9050/FLAG9bfc8f633 [2021-03-25 14:21:59,639 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:21:59,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_pso.opt.i [2021-03-25 14:21:59,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab18dcb1e/1dde3d2b95314fa4b06ccd824a2d9050/FLAG9bfc8f633 [2021-03-25 14:22:00,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab18dcb1e/1dde3d2b95314fa4b06ccd824a2d9050 [2021-03-25 14:22:00,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:22:00,141 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:22:00,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:22:00,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:22:00,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:22:00,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aef6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00, skipping insertion in model container [2021-03-25 14:22:00,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:22:00,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:22:00,351 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/mix018_pso.opt.i[948,961] [2021-03-25 14:22:00,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:22:00,496 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:22:00,505 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/mix018_pso.opt.i[948,961] [2021-03-25 14:22:00,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:22:00,601 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:22:00,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00 WrapperNode [2021-03-25 14:22:00,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:22:00,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:22:00,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:22:00,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:22:00,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:22:00,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:22:00,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:22:00,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:22:00,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (1/1) ... [2021-03-25 14:22:00,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:22:00,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:22:00,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:22:00,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:22:00,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (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-25 14:22:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:22:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:22:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:22:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:22:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:22:00,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:22:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:22:00,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:22:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:22:00,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:22:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:22:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:22:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:22:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:22:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:22:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:22:00,786 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:22:03,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:22:03,022 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:22:03,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:22:03 BoogieIcfgContainer [2021-03-25 14:22:03,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:22:03,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:22:03,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:22:03,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:22:03,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:22:00" (1/3) ... [2021-03-25 14:22:03,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484fe38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:22:03, skipping insertion in model container [2021-03-25 14:22:03,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:00" (2/3) ... [2021-03-25 14:22:03,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484fe38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:22:03, skipping insertion in model container [2021-03-25 14:22:03,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:22:03" (3/3) ... [2021-03-25 14:22:03,030 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_pso.opt.i [2021-03-25 14:22:03,036 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:22:03,040 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:22:03,040 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:22:03,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:03,133 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:22:03,149 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:22:03,167 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:22:03,167 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:22:03,167 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:22:03,168 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:22:03,168 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:22:03,168 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:22:03,168 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:22:03,168 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:22:03,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 14:22:03,214 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:22:03,214 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:03,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-25 14:22:03,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 14:22:03,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-25 14:22:03,224 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:03,235 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 14:22:03,237 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 14:22:03,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-25 14:22:03,257 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:22:03,258 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:03,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-25 14:22:03,261 INFO L142 LiptonReduction]: Number of co-enabled transitions 2394 [2021-03-25 14:22:04,684 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:22:04,797 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-03-25 14:22:05,181 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-25 14:22:05,298 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:22:06,720 INFO L154 LiptonReduction]: Checked pairs total: 3759 [2021-03-25 14:22:06,721 INFO L156 LiptonReduction]: Total number of compositions: 73 [2021-03-25 14:22:06,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3500 [2021-03-25 14:22:06,734 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:22:06,734 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:06,734 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:06,735 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-25 14:22:06,735 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1799313530, now seen corresponding path program 1 times [2021-03-25 14:22:06,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:06,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188174319] [2021-03-25 14:22:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:07,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:07,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:07,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:07,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:07,015 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-25 14:22:07,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188174319] [2021-03-25 14:22:07,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:07,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:22:07,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337137917] [2021-03-25 14:22:07,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:22:07,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:22:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:22:07,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2021-03-25 14:22:07,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:07,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:07,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2021-03-25 14:22:07,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:07,083 INFO L129 PetriNetUnfolder]: 13/83 cut-off events. [2021-03-25 14:22:07,083 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:07,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 83 events. 13/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 233 event pairs, 5 based on Foata normal form. 7/85 useless extension candidates. Maximal degree in co-relation 102. Up to 25 conditions per place. [2021-03-25 14:22:07,085 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 6 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-25 14:22:07,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 118 flow [2021-03-25 14:22:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:22:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:22:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2021-03-25 14:22:07,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184397163120568 [2021-03-25 14:22:07,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2021-03-25 14:22:07,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2021-03-25 14:22:07,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:07,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2021-03-25 14:22:07,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:07,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:07,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:07,131 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 518 transitions. [2021-03-25 14:22:07,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 118 flow [2021-03-25 14:22:07,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:07,136 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-25 14:22:07,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-25 14:22:07,138 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:22:07,138 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:07,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:22:07,140 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:22:07,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-25 14:22:07,149 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-25 14:22:07,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:07,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:22:07,150 INFO L142 LiptonReduction]: Number of co-enabled transitions 440 [2021-03-25 14:22:07,646 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:22:07,775 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:22:09,232 INFO L154 LiptonReduction]: Checked pairs total: 1334 [2021-03-25 14:22:09,232 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 14:22:09,233 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2095 [2021-03-25 14:22:09,234 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:22:09,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:09,234 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:09,234 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:09,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:22:09,235 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1766782407, now seen corresponding path program 1 times [2021-03-25 14:22:09,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:09,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982895995] [2021-03-25 14:22:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:09,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:09,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:09,363 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:22:09,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:22:09,374 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:22:09,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:22:09,378 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-25 14:22:09,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982895995] [2021-03-25 14:22:09,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:09,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:09,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195420469] [2021-03-25 14:22:09,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:09,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:09,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-25 14:22:09,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:09,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:09,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-25 14:22:09,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:09,558 INFO L129 PetriNetUnfolder]: 296/614 cut-off events. [2021-03-25 14:22:09,558 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:09,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 614 events. 296/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3491 event pairs, 68 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1085. Up to 221 conditions per place. [2021-03-25 14:22:09,567 INFO L132 encePairwiseOnDemand]: 193/202 looper letters, 7 selfloop transitions, 7 changer transitions 14/48 dead transitions. [2021-03-25 14:22:09,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 164 flow [2021-03-25 14:22:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2021-03-25 14:22:09,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8455445544554455 [2021-03-25 14:22:09,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2021-03-25 14:22:09,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2021-03-25 14:22:09,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:09,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2021-03-25 14:22:09,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-25 14:22:09,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:09,576 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:09,577 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 854 transitions. [2021-03-25 14:22:09,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 164 flow [2021-03-25 14:22:09,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:09,578 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 130 flow [2021-03-25 14:22:09,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-25 14:22:09,579 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2021-03-25 14:22:09,579 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:09,579 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 130 flow [2021-03-25 14:22:09,580 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 130 flow [2021-03-25 14:22:09,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 130 flow [2021-03-25 14:22:09,644 INFO L129 PetriNetUnfolder]: 152/364 cut-off events. [2021-03-25 14:22:09,644 INFO L130 PetriNetUnfolder]: For 73/105 co-relation queries the response was YES. [2021-03-25 14:22:09,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 364 events. 152/364 cut-off events. For 73/105 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2022 event pairs, 52 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 841. Up to 221 conditions per place. [2021-03-25 14:22:09,649 INFO L142 LiptonReduction]: Number of co-enabled transitions 370 [2021-03-25 14:22:10,516 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:22:10,694 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:22:11,007 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:22:11,170 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:22:11,188 INFO L154 LiptonReduction]: Checked pairs total: 837 [2021-03-25 14:22:11,188 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:11,188 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1609 [2021-03-25 14:22:11,189 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 124 flow [2021-03-25 14:22:11,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:11,190 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:11,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:22:11,190 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1720947380, now seen corresponding path program 1 times [2021-03-25 14:22:11,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:11,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477519005] [2021-03-25 14:22:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:11,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:11,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:11,248 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:22:11,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:22:11,260 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-25 14:22:11,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477519005] [2021-03-25 14:22:11,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:11,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:22:11,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267819901] [2021-03-25 14:22:11,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:11,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:11,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-25 14:22:11,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:11,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-25 14:22:11,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:11,349 INFO L129 PetriNetUnfolder]: 122/285 cut-off events. [2021-03-25 14:22:11,349 INFO L130 PetriNetUnfolder]: For 137/406 co-relation queries the response was YES. [2021-03-25 14:22:11,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 285 events. 122/285 cut-off events. For 137/406 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1348 event pairs, 14 based on Foata normal form. 3/276 useless extension candidates. Maximal degree in co-relation 895. Up to 181 conditions per place. [2021-03-25 14:22:11,353 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 13 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-25 14:22:11,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 208 flow [2021-03-25 14:22:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 697 transitions. [2021-03-25 14:22:11,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.85 [2021-03-25 14:22:11,355 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 697 transitions. [2021-03-25 14:22:11,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 697 transitions. [2021-03-25 14:22:11,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:11,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 697 transitions. [2021-03-25 14:22:11,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-25 14:22:11,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,359 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 124 flow. Second operand 4 states and 697 transitions. [2021-03-25 14:22:11,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 208 flow [2021-03-25 14:22:11,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 168 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:11,364 INFO L241 Difference]: Finished difference. Result has 42 places, 35 transitions, 156 flow [2021-03-25 14:22:11,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2021-03-25 14:22:11,364 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -16 predicate places. [2021-03-25 14:22:11,364 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:11,365 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 156 flow [2021-03-25 14:22:11,365 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 156 flow [2021-03-25 14:22:11,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 156 flow [2021-03-25 14:22:11,400 INFO L129 PetriNetUnfolder]: 122/291 cut-off events. [2021-03-25 14:22:11,401 INFO L130 PetriNetUnfolder]: For 147/173 co-relation queries the response was YES. [2021-03-25 14:22:11,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 291 events. 122/291 cut-off events. For 147/173 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1489 event pairs, 40 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 705. Up to 181 conditions per place. [2021-03-25 14:22:11,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 406 [2021-03-25 14:22:11,431 INFO L154 LiptonReduction]: Checked pairs total: 377 [2021-03-25 14:22:11,432 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:11,432 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-25 14:22:11,433 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 156 flow [2021-03-25 14:22:11,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:11,434 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:11,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:22:11,434 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1219750205, now seen corresponding path program 1 times [2021-03-25 14:22:11,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:11,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954334691] [2021-03-25 14:22:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:11,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:11,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:11,525 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-25 14:22:11,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954334691] [2021-03-25 14:22:11,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:11,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:22:11,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301275963] [2021-03-25 14:22:11,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:22:11,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:22:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:22:11,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 205 [2021-03-25 14:22:11,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:11,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 205 [2021-03-25 14:22:11,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:11,572 INFO L129 PetriNetUnfolder]: 106/265 cut-off events. [2021-03-25 14:22:11,572 INFO L130 PetriNetUnfolder]: For 245/333 co-relation queries the response was YES. [2021-03-25 14:22:11,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 265 events. 106/265 cut-off events. For 245/333 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1317 event pairs, 48 based on Foata normal form. 5/258 useless extension candidates. Maximal degree in co-relation 694. Up to 161 conditions per place. [2021-03-25 14:22:11,574 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 6 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2021-03-25 14:22:11,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 204 flow [2021-03-25 14:22:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:22:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:22:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2021-03-25 14:22:11,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8991869918699187 [2021-03-25 14:22:11,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2021-03-25 14:22:11,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2021-03-25 14:22:11,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:11,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2021-03-25 14:22:11,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,580 INFO L185 Difference]: Start difference. First operand has 42 places, 35 transitions, 156 flow. Second operand 3 states and 553 transitions. [2021-03-25 14:22:11,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 204 flow [2021-03-25 14:22:11,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:11,584 INFO L241 Difference]: Finished difference. Result has 44 places, 39 transitions, 205 flow [2021-03-25 14:22:11,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2021-03-25 14:22:11,585 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2021-03-25 14:22:11,585 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:11,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 205 flow [2021-03-25 14:22:11,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 205 flow [2021-03-25 14:22:11,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 205 flow [2021-03-25 14:22:11,617 INFO L129 PetriNetUnfolder]: 106/265 cut-off events. [2021-03-25 14:22:11,617 INFO L130 PetriNetUnfolder]: For 212/294 co-relation queries the response was YES. [2021-03-25 14:22:11,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 265 events. 106/265 cut-off events. For 212/294 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1327 event pairs, 50 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 702. Up to 161 conditions per place. [2021-03-25 14:22:11,620 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-25 14:22:11,630 INFO L154 LiptonReduction]: Checked pairs total: 523 [2021-03-25 14:22:11,630 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:11,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-25 14:22:11,631 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 205 flow [2021-03-25 14:22:11,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,632 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:11,632 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:11,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:22:11,632 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 239990628, now seen corresponding path program 1 times [2021-03-25 14:22:11,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:11,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297898925] [2021-03-25 14:22:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:11,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:11,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:11,753 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:11,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:11,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:11,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:11,767 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-25 14:22:11,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297898925] [2021-03-25 14:22:11,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:11,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:11,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319077321] [2021-03-25 14:22:11,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:11,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:11,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:11,771 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:22:11,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:11,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:11,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:22:11,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:11,991 INFO L129 PetriNetUnfolder]: 683/1341 cut-off events. [2021-03-25 14:22:11,991 INFO L130 PetriNetUnfolder]: For 411/482 co-relation queries the response was YES. [2021-03-25 14:22:11,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1341 events. 683/1341 cut-off events. For 411/482 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 9622 event pairs, 329 based on Foata normal form. 119/1332 useless extension candidates. Maximal degree in co-relation 3036. Up to 813 conditions per place. [2021-03-25 14:22:12,004 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2021-03-25 14:22:12,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 271 flow [2021-03-25 14:22:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 887 transitions. [2021-03-25 14:22:12,006 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8653658536585366 [2021-03-25 14:22:12,006 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 887 transitions. [2021-03-25 14:22:12,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 887 transitions. [2021-03-25 14:22:12,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:12,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 887 transitions. [2021-03-25 14:22:12,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,012 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,012 INFO L185 Difference]: Start difference. First operand has 44 places, 39 transitions, 205 flow. Second operand 5 states and 887 transitions. [2021-03-25 14:22:12,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 271 flow [2021-03-25 14:22:12,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:12,015 INFO L241 Difference]: Finished difference. Result has 50 places, 48 transitions, 274 flow [2021-03-25 14:22:12,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2021-03-25 14:22:12,016 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2021-03-25 14:22:12,016 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:12,016 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 48 transitions, 274 flow [2021-03-25 14:22:12,016 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 48 transitions, 274 flow [2021-03-25 14:22:12,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 274 flow [2021-03-25 14:22:12,123 INFO L129 PetriNetUnfolder]: 630/1218 cut-off events. [2021-03-25 14:22:12,123 INFO L130 PetriNetUnfolder]: For 1024/1723 co-relation queries the response was YES. [2021-03-25 14:22:12,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 1218 events. 630/1218 cut-off events. For 1024/1723 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 8699 event pairs, 276 based on Foata normal form. 6/1065 useless extension candidates. Maximal degree in co-relation 3598. Up to 756 conditions per place. [2021-03-25 14:22:12,138 INFO L142 LiptonReduction]: Number of co-enabled transitions 726 [2021-03-25 14:22:12,197 INFO L154 LiptonReduction]: Checked pairs total: 527 [2021-03-25 14:22:12,197 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:12,198 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182 [2021-03-25 14:22:12,199 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 268 flow [2021-03-25 14:22:12,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,201 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:12,201 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:12,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:22:12,201 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash 51896407, now seen corresponding path program 1 times [2021-03-25 14:22:12,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:12,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11293931] [2021-03-25 14:22:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:12,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:12,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:12,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:12,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:12,295 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:22:12,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:22:12,305 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-25 14:22:12,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11293931] [2021-03-25 14:22:12,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:12,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:12,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854738226] [2021-03-25 14:22:12,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:12,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:12,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:12,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-25 14:22:12,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:12,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-25 14:22:12,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:12,468 INFO L129 PetriNetUnfolder]: 706/1345 cut-off events. [2021-03-25 14:22:12,469 INFO L130 PetriNetUnfolder]: For 1599/2386 co-relation queries the response was YES. [2021-03-25 14:22:12,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 1345 events. 706/1345 cut-off events. For 1599/2386 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 9184 event pairs, 365 based on Foata normal form. 75/1261 useless extension candidates. Maximal degree in co-relation 4155. Up to 888 conditions per place. [2021-03-25 14:22:12,483 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 16 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2021-03-25 14:22:12,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 332 flow [2021-03-25 14:22:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-03-25 14:22:12,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8512195121951219 [2021-03-25 14:22:12,486 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-03-25 14:22:12,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-03-25 14:22:12,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:12,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-03-25 14:22:12,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,489 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,489 INFO L185 Difference]: Start difference. First operand has 50 places, 47 transitions, 268 flow. Second operand 4 states and 698 transitions. [2021-03-25 14:22:12,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 332 flow [2021-03-25 14:22:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 325 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:12,499 INFO L241 Difference]: Finished difference. Result has 51 places, 45 transitions, 293 flow [2021-03-25 14:22:12,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2021-03-25 14:22:12,500 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2021-03-25 14:22:12,500 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:12,500 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 293 flow [2021-03-25 14:22:12,500 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 293 flow [2021-03-25 14:22:12,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 293 flow [2021-03-25 14:22:12,611 INFO L129 PetriNetUnfolder]: 697/1305 cut-off events. [2021-03-25 14:22:12,611 INFO L130 PetriNetUnfolder]: For 1240/1578 co-relation queries the response was YES. [2021-03-25 14:22:12,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1305 events. 697/1305 cut-off events. For 1240/1578 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 8823 event pairs, 322 based on Foata normal form. 4/1168 useless extension candidates. Maximal degree in co-relation 3745. Up to 889 conditions per place. [2021-03-25 14:22:12,629 INFO L142 LiptonReduction]: Number of co-enabled transitions 570 [2021-03-25 14:22:12,719 INFO L154 LiptonReduction]: Checked pairs total: 223 [2021-03-25 14:22:12,719 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:12,719 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 219 [2021-03-25 14:22:12,721 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 293 flow [2021-03-25 14:22:12,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,721 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:12,721 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:12,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:22:12,721 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 65302401, now seen corresponding path program 1 times [2021-03-25 14:22:12,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:12,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288228421] [2021-03-25 14:22:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:12,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:12,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:12,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:12,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:12,820 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:12,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:12,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:12,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:12,831 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-25 14:22:12,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288228421] [2021-03-25 14:22:12,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:12,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:22:12,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763927649] [2021-03-25 14:22:12,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:12,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:12,833 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:22:12,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:12,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:12,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:22:12,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:13,011 INFO L129 PetriNetUnfolder]: 499/1101 cut-off events. [2021-03-25 14:22:13,012 INFO L130 PetriNetUnfolder]: For 1362/2850 co-relation queries the response was YES. [2021-03-25 14:22:13,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 1101 events. 499/1101 cut-off events. For 1362/2850 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7905 event pairs, 122 based on Foata normal form. 259/1282 useless extension candidates. Maximal degree in co-relation 3978. Up to 790 conditions per place. [2021-03-25 14:22:13,024 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 14 changer transitions 0/58 dead transitions. [2021-03-25 14:22:13,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 417 flow [2021-03-25 14:22:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:22:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:22:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2021-03-25 14:22:13,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.865040650406504 [2021-03-25 14:22:13,027 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2021-03-25 14:22:13,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2021-03-25 14:22:13,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:13,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2021-03-25 14:22:13,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,031 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,031 INFO L185 Difference]: Start difference. First operand has 51 places, 45 transitions, 293 flow. Second operand 6 states and 1064 transitions. [2021-03-25 14:22:13,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 417 flow [2021-03-25 14:22:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 407 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-25 14:22:13,038 INFO L241 Difference]: Finished difference. Result has 59 places, 54 transitions, 403 flow [2021-03-25 14:22:13,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2021-03-25 14:22:13,038 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-25 14:22:13,038 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:13,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 403 flow [2021-03-25 14:22:13,039 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 403 flow [2021-03-25 14:22:13,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 403 flow [2021-03-25 14:22:13,136 INFO L129 PetriNetUnfolder]: 493/1069 cut-off events. [2021-03-25 14:22:13,137 INFO L130 PetriNetUnfolder]: For 3377/5152 co-relation queries the response was YES. [2021-03-25 14:22:13,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 1069 events. 493/1069 cut-off events. For 3377/5152 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 7857 event pairs, 107 based on Foata normal form. 29/1016 useless extension candidates. Maximal degree in co-relation 4593. Up to 767 conditions per place. [2021-03-25 14:22:13,155 INFO L142 LiptonReduction]: Number of co-enabled transitions 826 [2021-03-25 14:22:13,327 INFO L154 LiptonReduction]: Checked pairs total: 638 [2021-03-25 14:22:13,327 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:13,328 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 290 [2021-03-25 14:22:13,329 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 395 flow [2021-03-25 14:22:13,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,329 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:13,329 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-25 14:22:13,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:22:13,329 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash -914309877, now seen corresponding path program 1 times [2021-03-25 14:22:13,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:13,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631881114] [2021-03-25 14:22:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:13,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,414 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:13,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:13,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:13,424 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-25 14:22:13,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631881114] [2021-03-25 14:22:13,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:13,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:22:13,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445468995] [2021-03-25 14:22:13,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:22:13,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:22:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:22:13,426 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:22:13,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:13,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:22:13,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:13,567 INFO L129 PetriNetUnfolder]: 267/648 cut-off events. [2021-03-25 14:22:13,567 INFO L130 PetriNetUnfolder]: For 2305/3751 co-relation queries the response was YES. [2021-03-25 14:22:13,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 648 events. 267/648 cut-off events. For 2305/3751 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4139 event pairs, 39 based on Foata normal form. 275/888 useless extension candidates. Maximal degree in co-relation 3096. Up to 451 conditions per place. [2021-03-25 14:22:13,574 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 18 changer transitions 4/62 dead transitions. [2021-03-25 14:22:13,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 537 flow [2021-03-25 14:22:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:22:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:22:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1241 transitions. [2021-03-25 14:22:13,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.864808362369338 [2021-03-25 14:22:13,578 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1241 transitions. [2021-03-25 14:22:13,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1241 transitions. [2021-03-25 14:22:13,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:13,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1241 transitions. [2021-03-25 14:22:13,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.28571428571428) internal successors, (1241), 7 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,585 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,585 INFO L185 Difference]: Start difference. First operand has 59 places, 53 transitions, 395 flow. Second operand 7 states and 1241 transitions. [2021-03-25 14:22:13,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 537 flow [2021-03-25 14:22:13,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 475 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:13,596 INFO L241 Difference]: Finished difference. Result has 62 places, 58 transitions, 455 flow [2021-03-25 14:22:13,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2021-03-25 14:22:13,596 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2021-03-25 14:22:13,596 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:13,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 58 transitions, 455 flow [2021-03-25 14:22:13,596 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 58 transitions, 455 flow [2021-03-25 14:22:13,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 58 transitions, 455 flow [2021-03-25 14:22:13,655 INFO L129 PetriNetUnfolder]: 255/616 cut-off events. [2021-03-25 14:22:13,655 INFO L130 PetriNetUnfolder]: For 1686/2128 co-relation queries the response was YES. [2021-03-25 14:22:13,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 616 events. 255/616 cut-off events. For 1686/2128 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4013 event pairs, 30 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 2602. Up to 377 conditions per place. [2021-03-25 14:22:13,664 INFO L142 LiptonReduction]: Number of co-enabled transitions 776 [2021-03-25 14:22:13,712 INFO L154 LiptonReduction]: Checked pairs total: 584 [2021-03-25 14:22:13,713 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:13,713 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-25 14:22:13,715 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 445 flow [2021-03-25 14:22:13,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:13,716 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-25 14:22:13,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:22:13,716 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 956422262, now seen corresponding path program 1 times [2021-03-25 14:22:13,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:13,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993493590] [2021-03-25 14:22:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:13,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:13,823 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:13,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:13,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:13,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:13,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993493590] [2021-03-25 14:22:13,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:13,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:22:13,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108211250] [2021-03-25 14:22:13,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:22:13,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:22:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:22:13,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:22:13,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:13,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:13,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:22:13,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:13,994 INFO L129 PetriNetUnfolder]: 193/456 cut-off events. [2021-03-25 14:22:13,994 INFO L130 PetriNetUnfolder]: For 1437/1893 co-relation queries the response was YES. [2021-03-25 14:22:13,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 456 events. 193/456 cut-off events. For 1437/1893 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2544 event pairs, 29 based on Foata normal form. 157/583 useless extension candidates. Maximal degree in co-relation 2018. Up to 242 conditions per place. [2021-03-25 14:22:14,002 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 2 selfloop transitions, 18 changer transitions 9/58 dead transitions. [2021-03-25 14:22:14,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 493 flow [2021-03-25 14:22:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:22:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:22:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1410 transitions. [2021-03-25 14:22:14,006 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8597560975609756 [2021-03-25 14:22:14,006 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1410 transitions. [2021-03-25 14:22:14,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1410 transitions. [2021-03-25 14:22:14,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:14,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1410 transitions. [2021-03-25 14:22:14,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 176.25) internal successors, (1410), 8 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:14,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:14,014 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:14,014 INFO L185 Difference]: Start difference. First operand has 62 places, 57 transitions, 445 flow. Second operand 8 states and 1410 transitions. [2021-03-25 14:22:14,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 493 flow [2021-03-25 14:22:14,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 444 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-25 14:22:14,024 INFO L241 Difference]: Finished difference. Result has 65 places, 49 transitions, 361 flow [2021-03-25 14:22:14,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=361, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2021-03-25 14:22:14,024 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2021-03-25 14:22:14,024 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:14,025 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 49 transitions, 361 flow [2021-03-25 14:22:14,025 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 49 transitions, 361 flow [2021-03-25 14:22:14,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 49 transitions, 361 flow [2021-03-25 14:22:14,052 INFO L129 PetriNetUnfolder]: 86/215 cut-off events. [2021-03-25 14:22:14,053 INFO L130 PetriNetUnfolder]: For 404/454 co-relation queries the response was YES. [2021-03-25 14:22:14,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 215 events. 86/215 cut-off events. For 404/454 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1008 event pairs, 13 based on Foata normal form. 1/204 useless extension candidates. Maximal degree in co-relation 782. Up to 72 conditions per place. [2021-03-25 14:22:14,056 INFO L142 LiptonReduction]: Number of co-enabled transitions 456 [2021-03-25 14:22:14,161 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:22:14,396 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:22:14,589 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:22:14,936 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:22:15,119 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:22:15,127 INFO L154 LiptonReduction]: Checked pairs total: 796 [2021-03-25 14:22:15,128 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:15,128 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1104 [2021-03-25 14:22:15,128 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 345 flow [2021-03-25 14:22:15,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:15,129 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-25 14:22:15,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:22:15,129 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 250632836, now seen corresponding path program 1 times [2021-03-25 14:22:15,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:15,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701159067] [2021-03-25 14:22:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:15,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:15,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:15,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:15,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:15,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:15,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:15,205 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-25 14:22:15,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701159067] [2021-03-25 14:22:15,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:15,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:15,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639189776] [2021-03-25 14:22:15,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:15,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:15,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:15,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 207 [2021-03-25 14:22:15,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 345 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-25 14:22:15,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:15,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 207 [2021-03-25 14:22:15,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:15,266 INFO L129 PetriNetUnfolder]: 136/332 cut-off events. [2021-03-25 14:22:15,266 INFO L130 PetriNetUnfolder]: For 1070/1180 co-relation queries the response was YES. [2021-03-25 14:22:15,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 332 events. 136/332 cut-off events. For 1070/1180 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1834 event pairs, 28 based on Foata normal form. 33/348 useless extension candidates. Maximal degree in co-relation 1194. Up to 106 conditions per place. [2021-03-25 14:22:15,269 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 3 selfloop transitions, 1 changer transitions 7/47 dead transitions. [2021-03-25 14:22:15,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 47 transitions, 361 flow [2021-03-25 14:22:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 730 transitions. [2021-03-25 14:22:15,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8816425120772947 [2021-03-25 14:22:15,272 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 730 transitions. [2021-03-25 14:22:15,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 730 transitions. [2021-03-25 14:22:15,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:15,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 730 transitions. [2021-03-25 14:22:15,274 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-25 14:22:15,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,276 INFO L185 Difference]: Start difference. First operand has 61 places, 46 transitions, 345 flow. Second operand 4 states and 730 transitions. [2021-03-25 14:22:15,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 47 transitions, 361 flow [2021-03-25 14:22:15,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 287 flow, removed 19 selfloop flow, removed 9 redundant places. [2021-03-25 14:22:15,282 INFO L241 Difference]: Finished difference. Result has 57 places, 40 transitions, 228 flow [2021-03-25 14:22:15,282 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2021-03-25 14:22:15,283 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2021-03-25 14:22:15,283 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:15,283 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 40 transitions, 228 flow [2021-03-25 14:22:15,283 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 40 transitions, 228 flow [2021-03-25 14:22:15,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 40 transitions, 228 flow [2021-03-25 14:22:15,298 INFO L129 PetriNetUnfolder]: 58/151 cut-off events. [2021-03-25 14:22:15,298 INFO L130 PetriNetUnfolder]: For 367/404 co-relation queries the response was YES. [2021-03-25 14:22:15,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 151 events. 58/151 cut-off events. For 367/404 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 668 event pairs, 6 based on Foata normal form. 15/160 useless extension candidates. Maximal degree in co-relation 435. Up to 45 conditions per place. [2021-03-25 14:22:15,300 INFO L142 LiptonReduction]: Number of co-enabled transitions 272 [2021-03-25 14:22:15,330 INFO L154 LiptonReduction]: Checked pairs total: 259 [2021-03-25 14:22:15,331 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:15,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 48 [2021-03-25 14:22:15,331 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 226 flow [2021-03-25 14:22:15,332 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-25 14:22:15,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:15,332 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-25 14:22:15,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:22:15,332 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 669680268, now seen corresponding path program 1 times [2021-03-25 14:22:15,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:15,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072667956] [2021-03-25 14:22:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:15,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:15,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:15,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:15,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:15,412 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:22:15,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:22:15,423 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-25 14:22:15,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072667956] [2021-03-25 14:22:15,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:15,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:15,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378191905] [2021-03-25 14:22:15,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:15,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:15,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 208 [2021-03-25 14:22:15,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:15,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 208 [2021-03-25 14:22:15,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:15,497 INFO L129 PetriNetUnfolder]: 99/250 cut-off events. [2021-03-25 14:22:15,498 INFO L130 PetriNetUnfolder]: For 666/722 co-relation queries the response was YES. [2021-03-25 14:22:15,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 250 events. 99/250 cut-off events. For 666/722 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1281 event pairs, 5 based on Foata normal form. 30/269 useless extension candidates. Maximal degree in co-relation 784. Up to 72 conditions per place. [2021-03-25 14:22:15,499 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 6 selfloop transitions, 12 changer transitions 6/49 dead transitions. [2021-03-25 14:22:15,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 342 flow [2021-03-25 14:22:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2021-03-25 14:22:15,502 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8134615384615385 [2021-03-25 14:22:15,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2021-03-25 14:22:15,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2021-03-25 14:22:15,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:15,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2021-03-25 14:22:15,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:15,506 INFO L185 Difference]: Start difference. First operand has 55 places, 39 transitions, 226 flow. Second operand 5 states and 846 transitions. [2021-03-25 14:22:15,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 342 flow [2021-03-25 14:22:15,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 310 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-03-25 14:22:15,513 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 271 flow [2021-03-25 14:22:15,513 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2021-03-25 14:22:15,513 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-25 14:22:15,513 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:15,513 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 271 flow [2021-03-25 14:22:15,514 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 271 flow [2021-03-25 14:22:15,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 271 flow [2021-03-25 14:22:15,530 INFO L129 PetriNetUnfolder]: 72/180 cut-off events. [2021-03-25 14:22:15,530 INFO L130 PetriNetUnfolder]: For 286/299 co-relation queries the response was YES. [2021-03-25 14:22:15,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 180 events. 72/180 cut-off events. For 286/299 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 847 event pairs, 3 based on Foata normal form. 8/176 useless extension candidates. Maximal degree in co-relation 569. Up to 58 conditions per place. [2021-03-25 14:22:15,532 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-25 14:22:16,083 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-25 14:22:16,230 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-25 14:22:17,213 WARN L205 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-03-25 14:22:17,497 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:22:17,503 INFO L154 LiptonReduction]: Checked pairs total: 127 [2021-03-25 14:22:17,503 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:17,503 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1990 [2021-03-25 14:22:17,504 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 271 flow [2021-03-25 14:22:17,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:17,504 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:17,504 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-25 14:22:17,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:22:17,505 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1985446127, now seen corresponding path program 1 times [2021-03-25 14:22:17,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:17,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359810879] [2021-03-25 14:22:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:17,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:17,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:17,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:17,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:17,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:17,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:17,599 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-25 14:22:17,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359810879] [2021-03-25 14:22:17,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:17,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:17,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983372546] [2021-03-25 14:22:17,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:17,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:17,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 209 [2021-03-25 14:22:17,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:17,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:17,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 209 [2021-03-25 14:22:17,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:17,633 INFO L129 PetriNetUnfolder]: 85/202 cut-off events. [2021-03-25 14:22:17,633 INFO L130 PetriNetUnfolder]: For 521/560 co-relation queries the response was YES. [2021-03-25 14:22:17,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 202 events. 85/202 cut-off events. For 521/560 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 947 event pairs, 1 based on Foata normal form. 15/200 useless extension candidates. Maximal degree in co-relation 645. Up to 66 conditions per place. [2021-03-25 14:22:17,635 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 3 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2021-03-25 14:22:17,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 42 transitions, 283 flow [2021-03-25 14:22:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 726 transitions. [2021-03-25 14:22:17,637 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.868421052631579 [2021-03-25 14:22:17,637 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 726 transitions. [2021-03-25 14:22:17,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 726 transitions. [2021-03-25 14:22:17,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:17,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 726 transitions. [2021-03-25 14:22:17,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:17,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:17,641 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:17,641 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 271 flow. Second operand 4 states and 726 transitions. [2021-03-25 14:22:17,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 42 transitions, 283 flow [2021-03-25 14:22:17,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 42 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:17,645 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 262 flow [2021-03-25 14:22:17,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2021-03-25 14:22:17,645 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-25 14:22:17,645 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:17,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 262 flow [2021-03-25 14:22:17,645 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 262 flow [2021-03-25 14:22:17,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 262 flow [2021-03-25 14:22:17,661 INFO L129 PetriNetUnfolder]: 80/191 cut-off events. [2021-03-25 14:22:17,661 INFO L130 PetriNetUnfolder]: For 390/428 co-relation queries the response was YES. [2021-03-25 14:22:17,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 191 events. 80/191 cut-off events. For 390/428 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 908 event pairs, 1 based on Foata normal form. 10/184 useless extension candidates. Maximal degree in co-relation 599. Up to 60 conditions per place. [2021-03-25 14:22:17,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-25 14:22:18,181 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-25 14:22:18,299 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-25 14:22:19,636 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-03-25 14:22:19,960 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:22:19,967 INFO L154 LiptonReduction]: Checked pairs total: 85 [2021-03-25 14:22:19,967 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:19,968 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2323 [2021-03-25 14:22:19,968 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 260 flow [2021-03-25 14:22:19,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:19,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:19,969 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:19,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:22:19,969 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1669554641, now seen corresponding path program 1 times [2021-03-25 14:22:19,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:19,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377841035] [2021-03-25 14:22:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:22:20,012 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:22:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:22:20,051 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:22:20,094 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:22:20,094 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:22:20,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:22:20,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:22:20 BasicIcfg [2021-03-25 14:22:20,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:22:20,209 INFO L168 Benchmark]: Toolchain (without parser) took 20068.74 ms. Allocated memory was 335.5 MB in the beginning and 685.8 MB in the end (delta: 350.2 MB). Free memory was 298.2 MB in the beginning and 544.9 MB in the end (delta: -246.7 MB). Peak memory consumption was 107.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:20,210 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 335.5 MB. Free memory was 316.9 MB in the beginning and 316.8 MB in the end (delta: 69.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:22:20,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.38 ms. Allocated memory is still 335.5 MB. Free memory was 298.0 MB in the beginning and 292.2 MB in the end (delta: 5.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:20,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.22 ms. Allocated memory is still 335.5 MB. Free memory was 292.2 MB in the beginning and 290.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:20,211 INFO L168 Benchmark]: Boogie Preprocessor took 45.81 ms. Allocated memory is still 335.5 MB. Free memory was 290.1 MB in the beginning and 286.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:20,211 INFO L168 Benchmark]: RCFGBuilder took 2325.85 ms. Allocated memory is still 335.5 MB. Free memory was 286.9 MB in the beginning and 184.5 MB in the end (delta: 102.5 MB). Peak memory consumption was 159.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:20,211 INFO L168 Benchmark]: TraceAbstraction took 17183.58 ms. Allocated memory was 335.5 MB in the beginning and 685.8 MB in the end (delta: 350.2 MB). Free memory was 183.4 MB in the beginning and 544.9 MB in the end (delta: -361.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:22:20,218 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.82 ms. Allocated memory is still 335.5 MB. Free memory was 316.9 MB in the beginning and 316.8 MB in the end (delta: 69.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 455.38 ms. Allocated memory is still 335.5 MB. Free memory was 298.0 MB in the beginning and 292.2 MB in the end (delta: 5.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.22 ms. Allocated memory is still 335.5 MB. Free memory was 292.2 MB in the beginning and 290.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.81 ms. Allocated memory is still 335.5 MB. Free memory was 290.1 MB in the beginning and 286.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2325.85 ms. Allocated memory is still 335.5 MB. Free memory was 286.9 MB in the beginning and 184.5 MB in the end (delta: 102.5 MB). Peak memory consumption was 159.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17183.58 ms. Allocated memory was 335.5 MB in the beginning and 685.8 MB in the end (delta: 350.2 MB). Free memory was 183.4 MB in the beginning and 544.9 MB in the end (delta: -361.5 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: 3483.3ms, 122 PlacesBefore, 58 PlacesAfterwards, 111 TransitionsBefore, 46 TransitionsAfterwards, 2394 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 3759 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2008, positive: 1923, positive conditional: 0, positive unconditional: 1923, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1456, positive: 1418, positive conditional: 0, positive unconditional: 1418, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1456, positive: 1418, positive conditional: 0, positive unconditional: 1418, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1456, positive: 1408, positive conditional: 0, positive unconditional: 1408, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 662, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 626, negative conditional: 0, negative unconditional: 626, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2008, positive: 505, positive conditional: 0, positive unconditional: 505, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 1456, unknown conditional: 0, unknown unconditional: 1456] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2092.7ms, 54 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 29 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 511, positive: 438, positive conditional: 0, positive unconditional: 438, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 128, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 128, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 658, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 636, negative conditional: 0, negative unconditional: 636, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, positive: 346, positive conditional: 0, positive unconditional: 346, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 128, unknown conditional: 0, unknown unconditional: 128] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1608.5ms, 46 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 31 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 837 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 353, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 353, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.4ms, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 377 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 523 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 143, positive: 116, positive conditional: 0, positive unconditional: 116, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 181.4ms, 50 PlacesBefore, 50 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 527 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 111, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.3ms, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 223 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 288.9ms, 59 PlacesBefore, 59 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 638 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 160, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 116.2ms, 62 PlacesBefore, 62 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 584 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 114, positive conditional: 0, positive unconditional: 114, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1103.0ms, 65 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 46 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 796 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 242, positive: 206, positive conditional: 0, positive unconditional: 206, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 242, positive: 196, positive conditional: 0, positive unconditional: 196, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.5ms, 57 PlacesBefore, 55 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 259 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 115, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1989.8ms, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 22, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2322.1ms, 55 PlacesBefore, 54 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 85 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t477; [L865] FCALL, FORK 0 pthread_create(&t477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L866] 0 pthread_t t478; [L867] FCALL, FORK 0 pthread_create(&t478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L868] 0 pthread_t t479; [L869] FCALL, FORK 0 pthread_create(&t479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L870] 0 pthread_t t480; [L871] FCALL, FORK 0 pthread_create(&t480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 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) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L827] 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) [L827] 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) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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)) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 4 __unbuffered_p3_EAX = z [L835] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=49, 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] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=49, 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] [L752] 1 a = 1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=49, 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] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=49, weak$$choice2=255, x=2, 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] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=49, weak$$choice2=255, x=2, 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] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=49, weak$$choice2=255, x=2, 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] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 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) [L789] 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) [L790] 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)) [L790] 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)) [L791] 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)) [L791] 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)) [L792] 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)) [L792] 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)) [L793] 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)) [L793] 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)) [L794] 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)) [L794] 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)) [L795] 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)) [L795] 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)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=51, weak$$choice2=255, x=2, 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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L842] 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) [L842] 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) [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L844] 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 [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L846] 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 [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L877] 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) [L877] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L877] 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) [L877] 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) [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L879] 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 [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L881] 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 [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 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_p1_EAX=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=51, weak$$choice2=255, x=2, 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, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16930.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1681.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3560.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 77 SDtfs, 46 SDslu, 47 SDs, 0 SdLazy, 227 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 241.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 182.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=8, InterpolantAutomatonStates: 58, 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: 72.4ms SsaConstructionTime, 484.3ms SatisfiabilityAnalysisTime, 734.4ms InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...