/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:38:14,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:38:14,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:38:14,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:38:14,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:38:14,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:38:14,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:38:14,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:38:14,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:38:14,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:38:14,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:38:14,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:38:14,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:38:14,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:38:14,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:38:14,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:38:14,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:38:14,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:38:14,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:38:14,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:38:14,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:38:14,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:38:14,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:38:14,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:38:14,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:38:14,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:38:14,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:38:14,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:38:14,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:38:14,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:38:14,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:38:14,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:38:14,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:38:14,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:38:14,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:38:14,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:38:14,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:38:14,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:38:14,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:38:14,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:38:14,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:38:14,700 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-RepeatedVariableLbe.epf [2021-03-25 04:38:14,734 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:38:14,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:38:14,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:38:14,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:38:14,737 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:38:14,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:38:14,738 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:38:14,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:38:14,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:38:14,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:38:14,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:38:14,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:38:14,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:38:14,739 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:38:14,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:38:14,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:38:14,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:38:14,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:38:14,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:38:14,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:38:14,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:38:14,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:38:14,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:38:14,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:38:14,741 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 04:38:15,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:38:15,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:38:15,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:38:15,088 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:38:15,089 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:38:15,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2021-03-25 04:38:15,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78beb1a4c/7caca9eec1294ee7a918499f6e4766f9/FLAG32036d0fd [2021-03-25 04:38:15,696 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:38:15,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2021-03-25 04:38:15,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78beb1a4c/7caca9eec1294ee7a918499f6e4766f9/FLAG32036d0fd [2021-03-25 04:38:16,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78beb1a4c/7caca9eec1294ee7a918499f6e4766f9 [2021-03-25 04:38:16,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:38:16,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:38:16,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:38:16,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:38:16,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:38:16,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a89793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16, skipping insertion in model container [2021-03-25 04:38:16,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:38:16,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:38:16,363 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/mix024_rmo.opt.i[991,1004] [2021-03-25 04:38:16,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:38:16,554 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:38:16,564 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/mix024_rmo.opt.i[991,1004] [2021-03-25 04:38:16,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:38:16,670 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:38:16,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16 WrapperNode [2021-03-25 04:38:16,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:38:16,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:38:16,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:38:16,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:38:16,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:38:16,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:38:16,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:38:16,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:38:16,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (1/1) ... [2021-03-25 04:38:16,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:38:16,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:38:16,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:38:16,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:38:16,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (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 04:38:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:38:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:38:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:38:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:38:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:38:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:38:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:38:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:38:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:38:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:38:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:38:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:38:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:38:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:38:16,861 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 04:38:18,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:38:18,394 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:38:18,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:38:18 BoogieIcfgContainer [2021-03-25 04:38:18,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:38:18,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:38:18,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:38:18,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:38:18,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:38:16" (1/3) ... [2021-03-25 04:38:18,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c6ceed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:38:18, skipping insertion in model container [2021-03-25 04:38:18,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:38:16" (2/3) ... [2021-03-25 04:38:18,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c6ceed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:38:18, skipping insertion in model container [2021-03-25 04:38:18,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:38:18" (3/3) ... [2021-03-25 04:38:18,403 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2021-03-25 04:38:18,409 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:38:18,413 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:38:18,414 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:38:18,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,484 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,503 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,503 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:38:18,508 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:38:18,523 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:38:18,550 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:38:18,550 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:38:18,550 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:38:18,550 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:38:18,550 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:38:18,550 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:38:18,550 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:38:18,550 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:38:18,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-03-25 04:38:18,612 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-25 04:38:18,612 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:38:18,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 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/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 04:38:18,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-03-25 04:38:18,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-03-25 04:38:18,631 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:18,638 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-25 04:38:18,641 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-25 04:38:18,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-03-25 04:38:18,672 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-25 04:38:18,672 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:38:18,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 04:38:18,677 INFO L142 LiptonReduction]: Number of co-enabled transitions 1872 [2021-03-25 04:38:19,445 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:38:19,865 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:38:19,988 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:38:21,062 INFO L154 LiptonReduction]: Checked pairs total: 3013 [2021-03-25 04:38:21,063 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-25 04:38:21,069 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2439 [2021-03-25 04:38:21,082 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 04:38:21,082 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:38:21,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:21,084 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:21,085 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1718052686, now seen corresponding path program 1 times [2021-03-25 04:38:21,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:21,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581061377] [2021-03-25 04:38:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:21,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:21,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:21,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:21,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:21,364 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 04:38:21,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581061377] [2021-03-25 04:38:21,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:21,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:38:21,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146595433] [2021-03-25 04:38:21,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:38:21,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:38:21,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:38:21,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 168 [2021-03-25 04:38:21,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 04:38:21,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:21,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 168 [2021-03-25 04:38:21,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:21,467 INFO L129 PetriNetUnfolder]: 29/144 cut-off events. [2021-03-25 04:38:21,467 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:38:21,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 144 events. 29/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 590 event pairs, 15 based on Foata normal form. 10/139 useless extension candidates. Maximal degree in co-relation 187. Up to 41 conditions per place. [2021-03-25 04:38:21,470 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-25 04:38:21,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 111 flow [2021-03-25 04:38:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:38:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:38:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2021-03-25 04:38:21,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2021-03-25 04:38:21,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2021-03-25 04:38:21,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2021-03-25 04:38:21,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:21,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2021-03-25 04:38:21,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 04:38:21,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 04:38:21,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 04:38:21,507 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 93 flow. Second operand 3 states and 462 transitions. [2021-03-25 04:38:21,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 111 flow [2021-03-25 04:38:21,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:38:21,511 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2021-03-25 04:38:21,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2021-03-25 04:38:21,513 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-25 04:38:21,513 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:21,513 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-25 04:38:21,514 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-25 04:38:21,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 88 flow [2021-03-25 04:38:21,523 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-25 04:38:21,523 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:38:21,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:38:21,524 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-25 04:38:22,671 INFO L154 LiptonReduction]: Checked pairs total: 1649 [2021-03-25 04:38:22,672 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 04:38:22,672 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1159 [2021-03-25 04:38:22,673 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-25 04:38:22,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 04:38:22,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:22,673 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 04:38:22,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:38:22,673 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1481096838, now seen corresponding path program 1 times [2021-03-25 04:38:22,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:22,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184886065] [2021-03-25 04:38:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:22,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:22,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:22,787 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:38:22,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:38:22,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:22,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:38:22,806 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 04:38:22,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184886065] [2021-03-25 04:38:22,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:22,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:38:22,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231549916] [2021-03-25 04:38:22,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:38:22,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:38:22,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:38:22,810 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 182 [2021-03-25 04:38:22,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:38:22,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:22,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 182 [2021-03-25 04:38:22,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:22,927 INFO L129 PetriNetUnfolder]: 148/364 cut-off events. [2021-03-25 04:38:22,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:38:22,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 364 events. 148/364 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2089 event pairs, 32 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 626. Up to 117 conditions per place. [2021-03-25 04:38:22,930 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 8 selfloop transitions, 7 changer transitions 14/44 dead transitions. [2021-03-25 04:38:22,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 156 flow [2021-03-25 04:38:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:38:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:38:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2021-03-25 04:38:22,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-03-25 04:38:22,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 735 transitions. [2021-03-25 04:38:22,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 735 transitions. [2021-03-25 04:38:22,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:22,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 735 transitions. [2021-03-25 04:38:22,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:38:22,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 04:38:22,937 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 04:38:22,937 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 735 transitions. [2021-03-25 04:38:22,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 156 flow [2021-03-25 04:38:22,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:38:22,939 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 120 flow [2021-03-25 04:38:22,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-03-25 04:38:22,939 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2021-03-25 04:38:22,939 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:22,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 120 flow [2021-03-25 04:38:22,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 120 flow [2021-03-25 04:38:22,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 120 flow [2021-03-25 04:38:22,963 INFO L129 PetriNetUnfolder]: 72/228 cut-off events. [2021-03-25 04:38:22,963 INFO L130 PetriNetUnfolder]: For 52/54 co-relation queries the response was YES. [2021-03-25 04:38:22,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 228 events. 72/228 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1269 event pairs, 32 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 484. Up to 117 conditions per place. [2021-03-25 04:38:22,967 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-25 04:38:23,087 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:38:23,304 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:38:23,730 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:38:23,892 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:38:24,258 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:38:24,414 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:38:24,432 INFO L154 LiptonReduction]: Checked pairs total: 573 [2021-03-25 04:38:24,432 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:38:24,433 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1494 [2021-03-25 04:38:24,433 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 116 flow [2021-03-25 04:38:24,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:38:24,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:24,434 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:24,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:38:24,434 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash 536191995, now seen corresponding path program 1 times [2021-03-25 04:38:24,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:24,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293701119] [2021-03-25 04:38:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:24,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:24,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:24,508 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:38:24,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:38:24,521 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 04:38:24,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293701119] [2021-03-25 04:38:24,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:24,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:38:24,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058967492] [2021-03-25 04:38:24,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:38:24,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:38:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:38:24,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 184 [2021-03-25 04:38:24,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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 04:38:24,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:24,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 184 [2021-03-25 04:38:24,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:24,584 INFO L129 PetriNetUnfolder]: 48/173 cut-off events. [2021-03-25 04:38:24,584 INFO L130 PetriNetUnfolder]: For 54/94 co-relation queries the response was YES. [2021-03-25 04:38:24,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 173 events. 48/173 cut-off events. For 54/94 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 872 event pairs, 8 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 463. Up to 83 conditions per place. [2021-03-25 04:38:24,589 INFO L132 encePairwiseOnDemand]: 177/184 looper letters, 12 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2021-03-25 04:38:24,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 184 flow [2021-03-25 04:38:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:38:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:38:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2021-03-25 04:38:24,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8084239130434783 [2021-03-25 04:38:24,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2021-03-25 04:38:24,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2021-03-25 04:38:24,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:24,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2021-03-25 04:38:24,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 04:38:24,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 04:38:24,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 04:38:24,600 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 116 flow. Second operand 4 states and 595 transitions. [2021-03-25 04:38:24,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 184 flow [2021-03-25 04:38:24,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 148 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-03-25 04:38:24,606 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 138 flow [2021-03-25 04:38:24,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-03-25 04:38:24,606 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2021-03-25 04:38:24,606 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:24,606 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 138 flow [2021-03-25 04:38:24,607 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 138 flow [2021-03-25 04:38:24,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 138 flow [2021-03-25 04:38:24,631 INFO L129 PetriNetUnfolder]: 48/163 cut-off events. [2021-03-25 04:38:24,631 INFO L130 PetriNetUnfolder]: For 61/65 co-relation queries the response was YES. [2021-03-25 04:38:24,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 163 events. 48/163 cut-off events. For 61/65 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 804 event pairs, 15 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 357. Up to 83 conditions per place. [2021-03-25 04:38:24,634 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-25 04:38:24,639 INFO L154 LiptonReduction]: Checked pairs total: 283 [2021-03-25 04:38:24,639 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:38:24,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 04:38:24,644 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 138 flow [2021-03-25 04:38:24,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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 04:38:24,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:24,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:24,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:38:24,646 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash 371145678, now seen corresponding path program 1 times [2021-03-25 04:38:24,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:24,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942687562] [2021-03-25 04:38:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:24,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:24,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:24,698 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:38:24,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:38:24,710 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 04:38:24,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942687562] [2021-03-25 04:38:24,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:24,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:38:24,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181792132] [2021-03-25 04:38:24,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:38:24,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:38:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:38:24,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 184 [2021-03-25 04:38:24,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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 04:38:24,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:24,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 184 [2021-03-25 04:38:24,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:24,779 INFO L129 PetriNetUnfolder]: 39/142 cut-off events. [2021-03-25 04:38:24,779 INFO L130 PetriNetUnfolder]: For 67/120 co-relation queries the response was YES. [2021-03-25 04:38:24,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 142 events. 39/142 cut-off events. For 67/120 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 645 event pairs, 14 based on Foata normal form. 10/150 useless extension candidates. Maximal degree in co-relation 392. Up to 70 conditions per place. [2021-03-25 04:38:24,781 INFO L132 encePairwiseOnDemand]: 176/184 looper letters, 13 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2021-03-25 04:38:24,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 232 flow [2021-03-25 04:38:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:38:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:38:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2021-03-25 04:38:24,783 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.811141304347826 [2021-03-25 04:38:24,783 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2021-03-25 04:38:24,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2021-03-25 04:38:24,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:24,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2021-03-25 04:38:24,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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 04:38:24,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 04:38:24,787 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 04:38:24,788 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 138 flow. Second operand 4 states and 597 transitions. [2021-03-25 04:38:24,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 232 flow [2021-03-25 04:38:24,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:38:24,792 INFO L241 Difference]: Finished difference. Result has 42 places, 36 transitions, 224 flow [2021-03-25 04:38:24,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2021-03-25 04:38:24,792 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2021-03-25 04:38:24,792 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:24,792 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 224 flow [2021-03-25 04:38:24,793 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 224 flow [2021-03-25 04:38:24,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 224 flow [2021-03-25 04:38:24,811 INFO L129 PetriNetUnfolder]: 39/143 cut-off events. [2021-03-25 04:38:24,811 INFO L130 PetriNetUnfolder]: For 167/175 co-relation queries the response was YES. [2021-03-25 04:38:24,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 143 events. 39/143 cut-off events. For 167/175 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 666 event pairs, 10 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 397. Up to 70 conditions per place. [2021-03-25 04:38:24,814 INFO L142 LiptonReduction]: Number of co-enabled transitions 338 [2021-03-25 04:38:24,818 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-25 04:38:24,818 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:38:24,818 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-25 04:38:24,818 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 224 flow [2021-03-25 04:38:24,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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 04:38:24,819 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:24,819 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:24,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:38:24,820 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2055582293, now seen corresponding path program 1 times [2021-03-25 04:38:24,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:24,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579031087] [2021-03-25 04:38:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:24,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:24,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:24,882 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:38:24,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:38:24,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:24,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:24,889 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 04:38:24,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579031087] [2021-03-25 04:38:24,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:24,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:38:24,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927363473] [2021-03-25 04:38:24,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:38:24,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:24,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:38:24,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:38:24,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-25 04:38:24,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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 04:38:24,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:24,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-25 04:38:24,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:24,957 INFO L129 PetriNetUnfolder]: 143/384 cut-off events. [2021-03-25 04:38:24,957 INFO L130 PetriNetUnfolder]: For 207/228 co-relation queries the response was YES. [2021-03-25 04:38:24,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 384 events. 143/384 cut-off events. For 207/228 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2507 event pairs, 59 based on Foata normal form. 38/395 useless extension candidates. Maximal degree in co-relation 917. Up to 201 conditions per place. [2021-03-25 04:38:24,961 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 8 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2021-03-25 04:38:24,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 276 flow [2021-03-25 04:38:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:38:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:38:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2021-03-25 04:38:24,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2021-03-25 04:38:24,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2021-03-25 04:38:24,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2021-03-25 04:38:24,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:24,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2021-03-25 04:38:24,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.6) internal successors, (788), 5 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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 04:38:24,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 04:38:24,967 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 04:38:24,967 INFO L185 Difference]: Start difference. First operand has 42 places, 36 transitions, 224 flow. Second operand 5 states and 788 transitions. [2021-03-25 04:38:24,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 276 flow [2021-03-25 04:38:24,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:38:24,971 INFO L241 Difference]: Finished difference. Result has 48 places, 43 transitions, 280 flow [2021-03-25 04:38:24,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2021-03-25 04:38:24,972 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-25 04:38:24,972 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:24,972 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 280 flow [2021-03-25 04:38:24,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 280 flow [2021-03-25 04:38:24,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 280 flow [2021-03-25 04:38:25,012 INFO L129 PetriNetUnfolder]: 148/397 cut-off events. [2021-03-25 04:38:25,013 INFO L130 PetriNetUnfolder]: For 384/493 co-relation queries the response was YES. [2021-03-25 04:38:25,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 397 events. 148/397 cut-off events. For 384/493 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2659 event pairs, 59 based on Foata normal form. 13/374 useless extension candidates. Maximal degree in co-relation 1171. Up to 210 conditions per place. [2021-03-25 04:38:25,019 INFO L142 LiptonReduction]: Number of co-enabled transitions 502 [2021-03-25 04:38:25,037 INFO L154 LiptonReduction]: Checked pairs total: 739 [2021-03-25 04:38:25,037 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:38:25,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-25 04:38:25,040 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 274 flow [2021-03-25 04:38:25,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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 04:38:25,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:25,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:25,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:38:25,041 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1956290094, now seen corresponding path program 1 times [2021-03-25 04:38:25,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:25,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087857874] [2021-03-25 04:38:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:25,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,135 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:38:25,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:38:25,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:25,144 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 04:38:25,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087857874] [2021-03-25 04:38:25,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:25,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:38:25,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597995087] [2021-03-25 04:38:25,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:38:25,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:38:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:38:25,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-25 04:38:25,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 04:38:25,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:25,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-25 04:38:25,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:25,234 INFO L129 PetriNetUnfolder]: 76/249 cut-off events. [2021-03-25 04:38:25,235 INFO L130 PetriNetUnfolder]: For 322/447 co-relation queries the response was YES. [2021-03-25 04:38:25,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 249 events. 76/249 cut-off events. For 322/447 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1401 event pairs, 13 based on Foata normal form. 68/310 useless extension candidates. Maximal degree in co-relation 873. Up to 136 conditions per place. [2021-03-25 04:38:25,237 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 5 selfloop transitions, 11 changer transitions 3/49 dead transitions. [2021-03-25 04:38:25,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 352 flow [2021-03-25 04:38:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:38:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:38:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 945 transitions. [2021-03-25 04:38:25,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8559782608695652 [2021-03-25 04:38:25,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 945 transitions. [2021-03-25 04:38:25,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 945 transitions. [2021-03-25 04:38:25,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:25,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 945 transitions. [2021-03-25 04:38:25,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 04:38:25,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 04:38:25,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 04:38:25,245 INFO L185 Difference]: Start difference. First operand has 48 places, 42 transitions, 274 flow. Second operand 6 states and 945 transitions. [2021-03-25 04:38:25,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 352 flow [2021-03-25 04:38:25,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 346 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:38:25,249 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 338 flow [2021-03-25 04:38:25,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-03-25 04:38:25,250 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2021-03-25 04:38:25,250 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:25,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 338 flow [2021-03-25 04:38:25,251 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 338 flow [2021-03-25 04:38:25,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 338 flow [2021-03-25 04:38:25,277 INFO L129 PetriNetUnfolder]: 74/251 cut-off events. [2021-03-25 04:38:25,277 INFO L130 PetriNetUnfolder]: For 529/613 co-relation queries the response was YES. [2021-03-25 04:38:25,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 251 events. 74/251 cut-off events. For 529/613 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1478 event pairs, 12 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 935. Up to 137 conditions per place. [2021-03-25 04:38:25,281 INFO L142 LiptonReduction]: Number of co-enabled transitions 456 [2021-03-25 04:38:25,294 INFO L154 LiptonReduction]: Checked pairs total: 774 [2021-03-25 04:38:25,294 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:38:25,294 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 04:38:25,296 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 330 flow [2021-03-25 04:38:25,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 04:38:25,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:25,297 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:25,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:38:25,297 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1455590369, now seen corresponding path program 1 times [2021-03-25 04:38:25,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:25,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077533719] [2021-03-25 04:38:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:25,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:25,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,383 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:38:25,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:38:25,395 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 04:38:25,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077533719] [2021-03-25 04:38:25,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:25,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:38:25,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508034765] [2021-03-25 04:38:25,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:38:25,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:38:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:38:25,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 184 [2021-03-25 04:38:25,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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 04:38:25,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:25,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 184 [2021-03-25 04:38:25,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:25,512 INFO L129 PetriNetUnfolder]: 82/257 cut-off events. [2021-03-25 04:38:25,513 INFO L130 PetriNetUnfolder]: For 529/585 co-relation queries the response was YES. [2021-03-25 04:38:25,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 257 events. 82/257 cut-off events. For 529/585 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1343 event pairs, 10 based on Foata normal form. 16/268 useless extension candidates. Maximal degree in co-relation 991. Up to 109 conditions per place. [2021-03-25 04:38:25,515 INFO L132 encePairwiseOnDemand]: 175/184 looper letters, 13 selfloop transitions, 23 changer transitions 0/55 dead transitions. [2021-03-25 04:38:25,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 465 flow [2021-03-25 04:38:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:38:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:38:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2021-03-25 04:38:25,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7978260869565217 [2021-03-25 04:38:25,523 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2021-03-25 04:38:25,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2021-03-25 04:38:25,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:25,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2021-03-25 04:38:25,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states 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 04:38:25,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 04:38:25,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 04:38:25,527 INFO L185 Difference]: Start difference. First operand has 52 places, 45 transitions, 330 flow. Second operand 5 states and 734 transitions. [2021-03-25 04:38:25,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 465 flow [2021-03-25 04:38:25,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 445 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 04:38:25,533 INFO L241 Difference]: Finished difference. Result has 54 places, 53 transitions, 461 flow [2021-03-25 04:38:25,533 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2021-03-25 04:38:25,533 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2021-03-25 04:38:25,534 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:25,534 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 53 transitions, 461 flow [2021-03-25 04:38:25,534 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 53 transitions, 461 flow [2021-03-25 04:38:25,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 461 flow [2021-03-25 04:38:25,565 INFO L129 PetriNetUnfolder]: 82/269 cut-off events. [2021-03-25 04:38:25,566 INFO L130 PetriNetUnfolder]: For 475/488 co-relation queries the response was YES. [2021-03-25 04:38:25,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 269 events. 82/269 cut-off events. For 475/488 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1505 event pairs, 9 based on Foata normal form. 2/265 useless extension candidates. Maximal degree in co-relation 949. Up to 81 conditions per place. [2021-03-25 04:38:25,569 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 04:38:25,577 INFO L154 LiptonReduction]: Checked pairs total: 532 [2021-03-25 04:38:25,578 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:38:25,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 04:38:25,578 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 461 flow [2021-03-25 04:38:25,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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 04:38:25,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:25,579 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:25,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:38:25,579 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1969154157, now seen corresponding path program 2 times [2021-03-25 04:38:25,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:25,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887672813] [2021-03-25 04:38:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:25,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:25,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,670 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:38:25,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:38:25,683 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 04:38:25,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887672813] [2021-03-25 04:38:25,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:25,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:38:25,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554775133] [2021-03-25 04:38:25,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:38:25,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:25,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:38:25,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:38:25,686 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 184 [2021-03-25 04:38:25,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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 04:38:25,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:25,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 184 [2021-03-25 04:38:25,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:25,786 INFO L129 PetriNetUnfolder]: 104/322 cut-off events. [2021-03-25 04:38:25,786 INFO L130 PetriNetUnfolder]: For 710/789 co-relation queries the response was YES. [2021-03-25 04:38:25,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 322 events. 104/322 cut-off events. For 710/789 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1854 event pairs, 15 based on Foata normal form. 22/335 useless extension candidates. Maximal degree in co-relation 1240. Up to 108 conditions per place. [2021-03-25 04:38:25,789 INFO L132 encePairwiseOnDemand]: 175/184 looper letters, 9 selfloop transitions, 22 changer transitions 9/59 dead transitions. [2021-03-25 04:38:25,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 605 flow [2021-03-25 04:38:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:38:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:38:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2021-03-25 04:38:25,791 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7961956521739131 [2021-03-25 04:38:25,792 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2021-03-25 04:38:25,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2021-03-25 04:38:25,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:25,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2021-03-25 04:38:25,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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 04:38:25,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 04:38:25,796 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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 04:38:25,796 INFO L185 Difference]: Start difference. First operand has 54 places, 53 transitions, 461 flow. Second operand 6 states and 879 transitions. [2021-03-25 04:38:25,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 605 flow [2021-03-25 04:38:25,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 599 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 04:38:25,801 INFO L241 Difference]: Finished difference. Result has 60 places, 48 transitions, 446 flow [2021-03-25 04:38:25,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2021-03-25 04:38:25,802 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2021-03-25 04:38:25,802 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:25,802 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 48 transitions, 446 flow [2021-03-25 04:38:25,802 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 48 transitions, 446 flow [2021-03-25 04:38:25,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 446 flow [2021-03-25 04:38:25,834 INFO L129 PetriNetUnfolder]: 73/252 cut-off events. [2021-03-25 04:38:25,834 INFO L130 PetriNetUnfolder]: For 605/620 co-relation queries the response was YES. [2021-03-25 04:38:25,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 252 events. 73/252 cut-off events. For 605/620 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1411 event pairs, 12 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 938. Up to 78 conditions per place. [2021-03-25 04:38:25,837 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-25 04:38:25,844 INFO L154 LiptonReduction]: Checked pairs total: 513 [2021-03-25 04:38:25,844 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:38:25,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-25 04:38:25,845 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 446 flow [2021-03-25 04:38:25,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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 04:38:25,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:25,845 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:25,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:38:25,846 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 679772737, now seen corresponding path program 3 times [2021-03-25 04:38:25,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:25,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628803307] [2021-03-25 04:38:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:25,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:25,966 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:38:25,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:38:25,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:25,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:25,975 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 04:38:25,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628803307] [2021-03-25 04:38:25,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:25,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:38:25,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967695935] [2021-03-25 04:38:25,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:38:25,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:25,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:38:25,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:38:25,977 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-25 04:38:25,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states 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 04:38:25,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:25,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-25 04:38:25,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:26,052 INFO L129 PetriNetUnfolder]: 59/211 cut-off events. [2021-03-25 04:38:26,052 INFO L130 PetriNetUnfolder]: For 549/601 co-relation queries the response was YES. [2021-03-25 04:38:26,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 211 events. 59/211 cut-off events. For 549/601 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1115 event pairs, 4 based on Foata normal form. 56/261 useless extension candidates. Maximal degree in co-relation 903. Up to 66 conditions per place. [2021-03-25 04:38:26,054 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 2 selfloop transitions, 11 changer transitions 14/52 dead transitions. [2021-03-25 04:38:26,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 52 transitions, 508 flow [2021-03-25 04:38:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:38:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:38:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1096 transitions. [2021-03-25 04:38:26,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8509316770186336 [2021-03-25 04:38:26,057 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1096 transitions. [2021-03-25 04:38:26,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1096 transitions. [2021-03-25 04:38:26,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:26,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1096 transitions. [2021-03-25 04:38:26,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states 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 04:38:26,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states 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 04:38:26,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states 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 04:38:26,063 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 446 flow. Second operand 7 states and 1096 transitions. [2021-03-25 04:38:26,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 52 transitions, 508 flow [2021-03-25 04:38:26,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 430 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-03-25 04:38:26,069 INFO L241 Difference]: Finished difference. Result has 61 places, 38 transitions, 290 flow [2021-03-25 04:38:26,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2021-03-25 04:38:26,069 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2021-03-25 04:38:26,069 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:26,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 38 transitions, 290 flow [2021-03-25 04:38:26,069 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 38 transitions, 290 flow [2021-03-25 04:38:26,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 38 transitions, 290 flow [2021-03-25 04:38:26,083 INFO L129 PetriNetUnfolder]: 28/130 cut-off events. [2021-03-25 04:38:26,083 INFO L130 PetriNetUnfolder]: For 279/281 co-relation queries the response was YES. [2021-03-25 04:38:26,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 130 events. 28/130 cut-off events. For 279/281 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 596 event pairs, 2 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 488. Up to 39 conditions per place. [2021-03-25 04:38:26,084 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-25 04:38:26,449 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:38:26,636 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:38:26,950 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:38:27,122 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:38:27,128 INFO L154 LiptonReduction]: Checked pairs total: 720 [2021-03-25 04:38:27,129 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:38:27,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1060 [2021-03-25 04:38:27,129 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 276 flow [2021-03-25 04:38:27,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states 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 04:38:27,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:27,130 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 04:38:27,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:38:27,130 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash 442810455, now seen corresponding path program 1 times [2021-03-25 04:38:27,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:27,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353693675] [2021-03-25 04:38:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:27,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:27,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:38:27,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:27,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:27,179 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:38:27,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:38:27,192 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 04:38:27,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353693675] [2021-03-25 04:38:27,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:27,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:38:27,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724144434] [2021-03-25 04:38:27,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:38:27,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:38:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:38:27,194 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 186 [2021-03-25 04:38:27,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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 04:38:27,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:27,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 186 [2021-03-25 04:38:27,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:27,238 INFO L129 PetriNetUnfolder]: 32/130 cut-off events. [2021-03-25 04:38:27,238 INFO L130 PetriNetUnfolder]: For 535/566 co-relation queries the response was YES. [2021-03-25 04:38:27,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 130 events. 32/130 cut-off events. For 535/566 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 626 event pairs, 4 based on Foata normal form. 15/140 useless extension candidates. Maximal degree in co-relation 528. Up to 40 conditions per place. [2021-03-25 04:38:27,239 INFO L132 encePairwiseOnDemand]: 182/186 looper letters, 5 selfloop transitions, 3 changer transitions 13/39 dead transitions. [2021-03-25 04:38:27,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 39 transitions, 342 flow [2021-03-25 04:38:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:38:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:38:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2021-03-25 04:38:27,242 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7997311827956989 [2021-03-25 04:38:27,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2021-03-25 04:38:27,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2021-03-25 04:38:27,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:27,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2021-03-25 04:38:27,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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 04:38:27,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states 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 04:38:27,245 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states 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 04:38:27,245 INFO L185 Difference]: Start difference. First operand has 56 places, 35 transitions, 276 flow. Second operand 4 states and 595 transitions. [2021-03-25 04:38:27,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 39 transitions, 342 flow [2021-03-25 04:38:27,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 283 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-03-25 04:38:27,248 INFO L241 Difference]: Finished difference. Result has 50 places, 26 transitions, 139 flow [2021-03-25 04:38:27,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2021-03-25 04:38:27,249 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2021-03-25 04:38:27,250 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:27,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 26 transitions, 139 flow [2021-03-25 04:38:27,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 26 transitions, 139 flow [2021-03-25 04:38:27,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 26 transitions, 139 flow [2021-03-25 04:38:27,255 INFO L129 PetriNetUnfolder]: 8/39 cut-off events. [2021-03-25 04:38:27,255 INFO L130 PetriNetUnfolder]: For 87/99 co-relation queries the response was YES. [2021-03-25 04:38:27,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 39 events. 8/39 cut-off events. For 87/99 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 2 based on Foata normal form. 9/47 useless extension candidates. Maximal degree in co-relation 98. Up to 13 conditions per place. [2021-03-25 04:38:27,256 INFO L142 LiptonReduction]: Number of co-enabled transitions 90 [2021-03-25 04:38:27,433 INFO L154 LiptonReduction]: Checked pairs total: 122 [2021-03-25 04:38:27,433 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:38:27,433 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 183 [2021-03-25 04:38:27,433 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 131 flow [2021-03-25 04:38:27,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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 04:38:27,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:27,434 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:27,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:38:27,434 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash -653237009, now seen corresponding path program 1 times [2021-03-25 04:38:27,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:27,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903078946] [2021-03-25 04:38:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:38:27,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:38:27,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:38:27,508 INFO L142 QuantifierPusher]: treesize reduction 17, result has 63.0 percent of original size [2021-03-25 04:38:27,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 04:38:27,528 INFO L142 QuantifierPusher]: treesize reduction 17, result has 67.9 percent of original size [2021-03-25 04:38:27,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 04:38:27,553 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 04:38:27,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:38:27,559 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 04:38:27,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903078946] [2021-03-25 04:38:27,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:38:27,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:38:27,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453427627] [2021-03-25 04:38:27,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:38:27,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:38:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:38:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:38:27,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2021-03-25 04:38:27,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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 04:38:27,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:38:27,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2021-03-25 04:38:27,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:38:27,676 INFO L129 PetriNetUnfolder]: 18/66 cut-off events. [2021-03-25 04:38:27,677 INFO L130 PetriNetUnfolder]: For 181/200 co-relation queries the response was YES. [2021-03-25 04:38:27,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 66 events. 18/66 cut-off events. For 181/200 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 220 event pairs, 0 based on Foata normal form. 14/78 useless extension candidates. Maximal degree in co-relation 182. Up to 22 conditions per place. [2021-03-25 04:38:27,677 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 4 selfloop transitions, 5 changer transitions 2/28 dead transitions. [2021-03-25 04:38:27,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 28 transitions, 167 flow [2021-03-25 04:38:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:38:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:38:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2021-03-25 04:38:27,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7392290249433107 [2021-03-25 04:38:27,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2021-03-25 04:38:27,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2021-03-25 04:38:27,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:38:27,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2021-03-25 04:38:27,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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 04:38:27,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:38:27,685 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:38:27,685 INFO L185 Difference]: Start difference. First operand has 44 places, 23 transitions, 131 flow. Second operand 7 states and 978 transitions. [2021-03-25 04:38:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 28 transitions, 167 flow [2021-03-25 04:38:27,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 139 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-03-25 04:38:27,687 INFO L241 Difference]: Finished difference. Result has 44 places, 25 transitions, 132 flow [2021-03-25 04:38:27,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2021-03-25 04:38:27,687 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2021-03-25 04:38:27,687 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:38:27,687 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 25 transitions, 132 flow [2021-03-25 04:38:27,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 25 transitions, 132 flow [2021-03-25 04:38:27,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 25 transitions, 132 flow [2021-03-25 04:38:27,693 INFO L129 PetriNetUnfolder]: 10/45 cut-off events. [2021-03-25 04:38:27,693 INFO L130 PetriNetUnfolder]: For 55/59 co-relation queries the response was YES. [2021-03-25 04:38:27,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 45 events. 10/45 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 1 based on Foata normal form. 4/48 useless extension candidates. Maximal degree in co-relation 121. Up to 14 conditions per place. [2021-03-25 04:38:27,694 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-25 04:38:28,461 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 181 [2021-03-25 04:38:28,752 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2021-03-25 04:38:30,053 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 306 DAG size of output: 261 [2021-03-25 04:38:30,630 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 04:38:30,661 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-25 04:38:30,662 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:38:30,662 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2975 [2021-03-25 04:38:30,662 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 126 flow [2021-03-25 04:38:30,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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 04:38:30,663 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:38:30,663 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:38:30,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:38:30,663 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:38:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:38:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1318150441, now seen corresponding path program 1 times [2021-03-25 04:38:30,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:38:30,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475408055] [2021-03-25 04:38:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:38:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:38:30,714 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:38:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:38:30,770 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:38:30,801 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:38:30,801 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:38:30,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:38:30,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:38:30 BasicIcfg [2021-03-25 04:38:30,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:38:30,914 INFO L168 Benchmark]: Toolchain (without parser) took 14739.01 ms. Allocated memory was 335.5 MB in the beginning and 641.7 MB in the end (delta: 306.2 MB). Free memory was 298.4 MB in the beginning and 550.2 MB in the end (delta: -251.7 MB). Peak memory consumption was 54.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:38:30,914 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 335.5 MB. Free memory was 316.8 MB in the beginning and 316.7 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:38:30,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.24 ms. Allocated memory is still 335.5 MB. Free memory was 298.2 MB in the beginning and 296.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:38:30,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.85 ms. Allocated memory is still 335.5 MB. Free memory was 296.9 MB in the beginning and 293.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:38:30,914 INFO L168 Benchmark]: Boogie Preprocessor took 32.53 ms. Allocated memory is still 335.5 MB. Free memory was 293.2 MB in the beginning and 291.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:38:30,915 INFO L168 Benchmark]: RCFGBuilder took 1631.16 ms. Allocated memory is still 335.5 MB. Free memory was 291.6 MB in the beginning and 240.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:38:30,915 INFO L168 Benchmark]: TraceAbstraction took 12515.86 ms. Allocated memory was 335.5 MB in the beginning and 641.7 MB in the end (delta: 306.2 MB). Free memory was 240.5 MB in the beginning and 550.2 MB in the end (delta: -309.7 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:38:30,916 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.18 ms. Allocated memory is still 335.5 MB. Free memory was 316.8 MB in the beginning and 316.7 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 493.24 ms. Allocated memory is still 335.5 MB. Free memory was 298.2 MB in the beginning and 296.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 58.85 ms. Allocated memory is still 335.5 MB. Free memory was 296.9 MB in the beginning and 293.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.53 ms. Allocated memory is still 335.5 MB. Free memory was 293.2 MB in the beginning and 291.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1631.16 ms. Allocated memory is still 335.5 MB. Free memory was 291.6 MB in the beginning and 240.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12515.86 ms. Allocated memory was 335.5 MB in the beginning and 641.7 MB in the end (delta: 306.2 MB). Free memory was 240.5 MB in the beginning and 550.2 MB in the end (delta: -309.7 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2422.0ms, 108 PlacesBefore, 51 PlacesAfterwards, 100 TransitionsBefore, 42 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3013 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1559, positive: 1483, positive conditional: 0, positive unconditional: 1483, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 874, positive: 853, positive conditional: 0, positive unconditional: 853, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 874, positive: 853, positive conditional: 0, positive unconditional: 853, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1559, positive: 630, positive conditional: 0, positive unconditional: 630, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1157.7ms, 48 PlacesBefore, 34 PlacesAfterwards, 39 TransitionsBefore, 25 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 372, positive conditional: 0, positive unconditional: 372, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 77, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 476, positive: 318, positive conditional: 0, positive unconditional: 318, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1492.7ms, 40 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 573 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 181, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 181, positive: 145, positive conditional: 0, positive unconditional: 145, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.9ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 70, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.3ms, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 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: 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] , Cache Queries: [ total: 59, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.8ms, 48 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 182, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.4ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 171, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 532 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 72, positive conditional: 0, positive unconditional: 72, 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: 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: 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] , Cache Queries: [ total: 92, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.1ms, 60 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 513 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 46, positive conditional: 0, positive unconditional: 46, 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: 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: 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] , Cache Queries: [ total: 68, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1059.3ms, 61 PlacesBefore, 56 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 720 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 71, positive conditional: 0, positive unconditional: 71, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 182.9ms, 50 PlacesBefore, 44 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2974.1ms, 44 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, 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: 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] , Cache Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_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; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t648; [L845] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t649; [L847] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t650; [L849] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12257.4ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1141.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2523.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 92 SDtfs, 49 SDslu, 56 SDs, 0 SdLazy, 210 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 267.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 276.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.2ms SsaConstructionTime, 416.8ms SatisfiabilityAnalysisTime, 708.1ms InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...