/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:02:57,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:02:57,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:02:57,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:02:57,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:02:57,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:02:57,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:02:57,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:02:57,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:02:57,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:02:57,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:02:57,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:02:57,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:02:57,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:02:57,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:02:58,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:02:58,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:02:58,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:02:58,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:02:58,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:02:58,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:02:58,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:02:58,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:02:58,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:02:58,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:02:58,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:02:58,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:02:58,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:02:58,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:02:58,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:02:58,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:02:58,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:02:58,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:02:58,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:02:58,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:02:58,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:02:58,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:02:58,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:02:58,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:02:58,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:02:58,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:02:58,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:02:58,067 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:02:58,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:02:58,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:02:58,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:02:58,072 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:02:58,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:02:58,072 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:02:58,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:02:58,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:02:58,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:02:58,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:02:58,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:02:58,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:02:58,074 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:02:58,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:02:58,074 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:02:58,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:02:58,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:02:58,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:02:58,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:02:58,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:02:58,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:02:58,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:02:58,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:02:58,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:02:58,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:02:58,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:02:58,076 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:02:58,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:02:58,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:02:58,076 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:02:58,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:02:58,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:02:58,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:02:58,403 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:02:58,403 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:02:58,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2021-03-26 10:02:58,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969c58c68/e4ba4bc06b7845db82197797953268ce/FLAG083041e46 [2021-03-26 10:02:59,047 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:02:59,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2021-03-26 10:02:59,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969c58c68/e4ba4bc06b7845db82197797953268ce/FLAG083041e46 [2021-03-26 10:02:59,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969c58c68/e4ba4bc06b7845db82197797953268ce [2021-03-26 10:02:59,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:02:59,459 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:02:59,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:02:59,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:02:59,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:02:59,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:02:59,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac336b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59, skipping insertion in model container [2021-03-26 10:02:59,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:02:59,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:02:59,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:02:59,638 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/mix028_rmo.opt.i[948,961] [2021-03-26 10:02:59,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:02:59,845 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:02:59,854 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/mix028_rmo.opt.i[948,961] [2021-03-26 10:02:59,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:02:59,954 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:02:59,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59 WrapperNode [2021-03-26 10:02:59,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:02:59,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:02:59,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:02:59,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:02:59,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:02:59,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:03:00,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:03:00,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:03:00,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:03:00,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... [2021-03-26 10:03:00,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:03:00,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:03:00,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:03:00,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:03:00,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:03:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:03:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:03:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:03:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:03:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:03:00,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:03:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:03:00,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:03:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:03:00,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:03:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:03:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:03:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:03:00,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:03:00,150 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:03:01,846 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:03:01,847 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:03:01,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:03:01 BoogieIcfgContainer [2021-03-26 10:03:01,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:03:01,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:03:01,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:03:01,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:03:01,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:02:59" (1/3) ... [2021-03-26 10:03:01,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed56c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:03:01, skipping insertion in model container [2021-03-26 10:03:01,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:02:59" (2/3) ... [2021-03-26 10:03:01,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed56c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:03:01, skipping insertion in model container [2021-03-26 10:03:01,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:03:01" (3/3) ... [2021-03-26 10:03:01,857 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2021-03-26 10:03:01,863 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:03:01,867 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:03:01,868 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:03:01,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,912 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,912 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,913 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,913 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,914 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,914 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,919 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,919 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,929 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:03:01,940 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:03:01,957 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:03:01,984 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:03:01,984 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:03:01,985 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:03:01,985 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:03:01,985 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:03:01,985 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:03:01,985 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:03:01,985 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:03:01,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-26 10:03:02,033 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-26 10:03:02,034 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:02,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:03:02,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-26 10:03:02,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-26 10:03:02,054 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:02,065 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-26 10:03:02,068 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-26 10:03:02,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-26 10:03:02,101 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-26 10:03:02,101 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:02,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:03:02,104 INFO L142 LiptonReduction]: Number of co-enabled transitions 1770 [2021-03-26 10:03:02,997 WARN L205 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 10:03:03,361 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:03:04,786 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:03:05,337 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:03:06,437 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:03:06,837 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:03:06,947 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:03:08,392 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:03:08,684 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:03:09,320 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:03:09,945 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:03:10,186 INFO L154 LiptonReduction]: Checked pairs total: 3423 [2021-03-26 10:03:10,186 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-26 10:03:10,188 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8135 [2021-03-26 10:03:10,196 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:03:10,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:10,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:10,197 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:10,197 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-26 10:03:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:10,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1762051857, now seen corresponding path program 1 times [2021-03-26 10:03:10,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:10,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157559045] [2021-03-26 10:03:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:10,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:10,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:10,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:10,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:10,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157559045] [2021-03-26 10:03:10,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:10,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:03:10,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406574034] [2021-03-26 10:03:10,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:03:10,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:03:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:03:10,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 166 [2021-03-26 10:03:10,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:10,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:10,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 166 [2021-03-26 10:03:10,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:10,555 INFO L129 PetriNetUnfolder]: 69/186 cut-off events. [2021-03-26 10:03:10,555 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:10,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 186 events. 69/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 898 event pairs, 13 based on Foata normal form. 10/174 useless extension candidates. Maximal degree in co-relation 295. Up to 89 conditions per place. [2021-03-26 10:03:10,559 INFO L132 encePairwiseOnDemand]: 162/166 looper letters, 9 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2021-03-26 10:03:10,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 10:03:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:03:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:03:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2021-03-26 10:03:10,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8875502008032129 [2021-03-26 10:03:10,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2021-03-26 10:03:10,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2021-03-26 10:03:10,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:10,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2021-03-26 10:03:10,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:10,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:10,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:10,592 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 442 transitions. [2021-03-26 10:03:10,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 10:03:10,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:03:10,596 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 76 flow [2021-03-26 10:03:10,598 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-03-26 10:03:10,598 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:03:10,599 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:10,599 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 76 flow [2021-03-26 10:03:10,599 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 76 flow [2021-03-26 10:03:10,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2021-03-26 10:03:10,604 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-26 10:03:10,604 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:10,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:03:10,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-26 10:03:11,110 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:03:11,390 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:03:11,971 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:03:12,541 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:03:13,681 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-26 10:03:13,883 INFO L154 LiptonReduction]: Checked pairs total: 1380 [2021-03-26 10:03:13,883 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:03:13,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3285 [2021-03-26 10:03:13,884 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:03:13,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:13,885 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:13,885 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:13,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:03:13,885 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-26 10:03:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1872499291, now seen corresponding path program 1 times [2021-03-26 10:03:13,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:13,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997276201] [2021-03-26 10:03:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:14,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:14,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:14,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:14,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:14,057 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:03:14,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:03:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:14,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997276201] [2021-03-26 10:03:14,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:14,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:14,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20797378] [2021-03-26 10:03:14,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:14,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:14,064 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 175 [2021-03-26 10:03:14,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:14,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:14,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 175 [2021-03-26 10:03:14,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:14,080 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:03:14,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:14,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:03:14,081 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 10:03:14,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 10:03:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:03:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:03:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 10:03:14,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8704761904761905 [2021-03-26 10:03:14,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 10:03:14,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 10:03:14,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:14,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 10:03:14,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:14,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:14,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:14,090 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 457 transitions. [2021-03-26 10:03:14,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 10:03:14,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:14,091 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 10:03:14,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 10:03:14,091 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:03:14,092 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:14,092 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:03:14,092 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:03:14,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 10:03:14,097 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:03:14,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:03:14,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:03:14,098 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-26 10:03:14,421 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:03:14,552 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:03:14,814 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:03:14,930 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:03:14,934 INFO L154 LiptonReduction]: Checked pairs total: 588 [2021-03-26 10:03:14,934 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:03:14,935 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 843 [2021-03-26 10:03:14,935 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-26 10:03:14,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:14,936 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:14,936 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:14,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:03:14,936 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-26 10:03:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1352985518, now seen corresponding path program 1 times [2021-03-26 10:03:14,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:14,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063709670] [2021-03-26 10:03:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:15,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:15,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:03:15,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:03:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:15,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063709670] [2021-03-26 10:03:15,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:15,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:03:15,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905945367] [2021-03-26 10:03:15,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:15,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:15,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 176 [2021-03-26 10:03:15,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:15,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 176 [2021-03-26 10:03:15,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:15,180 INFO L129 PetriNetUnfolder]: 84/173 cut-off events. [2021-03-26 10:03:15,180 INFO L130 PetriNetUnfolder]: For 8/15 co-relation queries the response was YES. [2021-03-26 10:03:15,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 173 events. 84/173 cut-off events. For 8/15 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 742 event pairs, 52 based on Foata normal form. 4/163 useless extension candidates. Maximal degree in co-relation 333. Up to 131 conditions per place. [2021-03-26 10:03:15,185 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 9 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2021-03-26 10:03:15,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 112 flow [2021-03-26 10:03:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2021-03-26 10:03:15,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7982954545454546 [2021-03-26 10:03:15,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2021-03-26 10:03:15,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2021-03-26 10:03:15,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:15,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2021-03-26 10:03:15,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,192 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 562 transitions. [2021-03-26 10:03:15,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 112 flow [2021-03-26 10:03:15,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:15,194 INFO L241 Difference]: Finished difference. Result has 35 places, 29 transitions, 109 flow [2021-03-26 10:03:15,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2021-03-26 10:03:15,194 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-26 10:03:15,194 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:15,195 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 109 flow [2021-03-26 10:03:15,195 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 109 flow [2021-03-26 10:03:15,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 109 flow [2021-03-26 10:03:15,208 INFO L129 PetriNetUnfolder]: 26/98 cut-off events. [2021-03-26 10:03:15,208 INFO L130 PetriNetUnfolder]: For 24/32 co-relation queries the response was YES. [2021-03-26 10:03:15,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 98 events. 26/98 cut-off events. For 24/32 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 383 event pairs, 7 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 190. Up to 43 conditions per place. [2021-03-26 10:03:15,210 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-26 10:03:15,276 INFO L154 LiptonReduction]: Checked pairs total: 186 [2021-03-26 10:03:15,276 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:15,276 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-03-26 10:03:15,279 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 109 flow [2021-03-26 10:03:15,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,281 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:15,281 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:15,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:03:15,281 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-26 10:03:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1086441850, now seen corresponding path program 1 times [2021-03-26 10:03:15,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:15,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987750966] [2021-03-26 10:03:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:15,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:03:15,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:03:15,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:03:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:15,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987750966] [2021-03-26 10:03:15,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:15,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:15,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343532405] [2021-03-26 10:03:15,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:03:15,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:03:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:03:15,422 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 176 [2021-03-26 10:03:15,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:15,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 176 [2021-03-26 10:03:15,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:15,504 INFO L129 PetriNetUnfolder]: 80/168 cut-off events. [2021-03-26 10:03:15,504 INFO L130 PetriNetUnfolder]: For 115/230 co-relation queries the response was YES. [2021-03-26 10:03:15,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 168 events. 80/168 cut-off events. For 115/230 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 721 event pairs, 51 based on Foata normal form. 13/169 useless extension candidates. Maximal degree in co-relation 471. Up to 130 conditions per place. [2021-03-26 10:03:15,506 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 15 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-03-26 10:03:15,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 205 flow [2021-03-26 10:03:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2021-03-26 10:03:15,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7684659090909091 [2021-03-26 10:03:15,508 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2021-03-26 10:03:15,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2021-03-26 10:03:15,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:15,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2021-03-26 10:03:15,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,512 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 109 flow. Second operand 4 states and 541 transitions. [2021-03-26 10:03:15,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 205 flow [2021-03-26 10:03:15,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:03:15,515 INFO L241 Difference]: Finished difference. Result has 40 places, 37 transitions, 195 flow [2021-03-26 10:03:15,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2021-03-26 10:03:15,515 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 10:03:15,515 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:15,515 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 37 transitions, 195 flow [2021-03-26 10:03:15,515 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 195 flow [2021-03-26 10:03:15,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 195 flow [2021-03-26 10:03:15,536 INFO L129 PetriNetUnfolder]: 40/116 cut-off events. [2021-03-26 10:03:15,536 INFO L130 PetriNetUnfolder]: For 120/166 co-relation queries the response was YES. [2021-03-26 10:03:15,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 116 events. 40/116 cut-off events. For 120/166 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 469 event pairs, 8 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 311. Up to 55 conditions per place. [2021-03-26 10:03:15,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:03:15,545 INFO L154 LiptonReduction]: Checked pairs total: 396 [2021-03-26 10:03:15,545 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:15,545 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 10:03:15,550 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 195 flow [2021-03-26 10:03:15,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,551 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:15,551 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:15,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:03:15,551 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-26 10:03:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash -17962883, now seen corresponding path program 1 times [2021-03-26 10:03:15,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:15,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197914111] [2021-03-26 10:03:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:15,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:03:15,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:03:15,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:03:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:15,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197914111] [2021-03-26 10:03:15,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:15,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:15,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321277563] [2021-03-26 10:03:15,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:03:15,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:03:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:03:15,659 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 176 [2021-03-26 10:03:15,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:15,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 176 [2021-03-26 10:03:15,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:15,735 INFO L129 PetriNetUnfolder]: 72/158 cut-off events. [2021-03-26 10:03:15,735 INFO L130 PetriNetUnfolder]: For 249/508 co-relation queries the response was YES. [2021-03-26 10:03:15,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 158 events. 72/158 cut-off events. For 249/508 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 641 event pairs, 23 based on Foata normal form. 19/170 useless extension candidates. Maximal degree in co-relation 524. Up to 102 conditions per place. [2021-03-26 10:03:15,737 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 21 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2021-03-26 10:03:15,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 265 flow [2021-03-26 10:03:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2021-03-26 10:03:15,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2021-03-26 10:03:15,739 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2021-03-26 10:03:15,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2021-03-26 10:03:15,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:15,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2021-03-26 10:03:15,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,744 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,744 INFO L185 Difference]: Start difference. First operand has 40 places, 37 transitions, 195 flow. Second operand 4 states and 540 transitions. [2021-03-26 10:03:15,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 265 flow [2021-03-26 10:03:15,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:03:15,749 INFO L241 Difference]: Finished difference. Result has 44 places, 37 transitions, 212 flow [2021-03-26 10:03:15,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2021-03-26 10:03:15,750 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-03-26 10:03:15,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:15,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 212 flow [2021-03-26 10:03:15,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 212 flow [2021-03-26 10:03:15,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 212 flow [2021-03-26 10:03:15,768 INFO L129 PetriNetUnfolder]: 41/112 cut-off events. [2021-03-26 10:03:15,769 INFO L130 PetriNetUnfolder]: For 176/212 co-relation queries the response was YES. [2021-03-26 10:03:15,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 112 events. 41/112 cut-off events. For 176/212 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 433 event pairs, 8 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 325. Up to 56 conditions per place. [2021-03-26 10:03:15,770 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:03:15,778 INFO L154 LiptonReduction]: Checked pairs total: 352 [2021-03-26 10:03:15,778 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:15,778 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 10:03:15,780 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 212 flow [2021-03-26 10:03:15,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:15,780 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:15,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:03:15,780 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-26 10:03:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:15,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1466085085, now seen corresponding path program 1 times [2021-03-26 10:03:15,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:15,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803551242] [2021-03-26 10:03:15,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:15,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:03:15,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:03:15,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:03:15,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:15,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:03:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:15,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803551242] [2021-03-26 10:03:15,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:15,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:15,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785626902] [2021-03-26 10:03:15,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:03:15,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:03:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:03:15,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 176 [2021-03-26 10:03:15,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:15,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 176 [2021-03-26 10:03:15,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:15,983 INFO L129 PetriNetUnfolder]: 72/157 cut-off events. [2021-03-26 10:03:15,983 INFO L130 PetriNetUnfolder]: For 356/614 co-relation queries the response was YES. [2021-03-26 10:03:15,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 157 events. 72/157 cut-off events. For 356/614 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 685 event pairs, 44 based on Foata normal form. 19/163 useless extension candidates. Maximal degree in co-relation 559. Up to 113 conditions per place. [2021-03-26 10:03:15,985 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 10 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2021-03-26 10:03:15,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 269 flow [2021-03-26 10:03:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2021-03-26 10:03:15,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7741477272727273 [2021-03-26 10:03:15,987 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2021-03-26 10:03:15,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2021-03-26 10:03:15,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:15,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2021-03-26 10:03:15,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:15,991 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 212 flow. Second operand 4 states and 545 transitions. [2021-03-26 10:03:15,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 269 flow [2021-03-26 10:03:15,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 258 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:15,994 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 252 flow [2021-03-26 10:03:15,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2021-03-26 10:03:15,994 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-26 10:03:15,995 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:15,995 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 252 flow [2021-03-26 10:03:15,995 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 252 flow [2021-03-26 10:03:15,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 252 flow [2021-03-26 10:03:16,009 INFO L129 PetriNetUnfolder]: 41/112 cut-off events. [2021-03-26 10:03:16,010 INFO L130 PetriNetUnfolder]: For 208/245 co-relation queries the response was YES. [2021-03-26 10:03:16,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 112 events. 41/112 cut-off events. For 208/245 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 419 event pairs, 12 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 379. Up to 57 conditions per place. [2021-03-26 10:03:16,011 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-26 10:03:16,119 INFO L154 LiptonReduction]: Checked pairs total: 487 [2021-03-26 10:03:16,120 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:16,120 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 125 [2021-03-26 10:03:16,121 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 252 flow [2021-03-26 10:03:16,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:16,121 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:16,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:03:16,121 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-26 10:03:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash 690425823, now seen corresponding path program 1 times [2021-03-26 10:03:16,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:16,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439859109] [2021-03-26 10:03:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:16,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:03:16,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:03:16,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:03:16,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:03:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:16,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439859109] [2021-03-26 10:03:16,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:16,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:03:16,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540335193] [2021-03-26 10:03:16,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:03:16,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:03:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:03:16,246 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 176 [2021-03-26 10:03:16,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:16,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 176 [2021-03-26 10:03:16,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:16,369 INFO L129 PetriNetUnfolder]: 79/183 cut-off events. [2021-03-26 10:03:16,369 INFO L130 PetriNetUnfolder]: For 577/850 co-relation queries the response was YES. [2021-03-26 10:03:16,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 183 events. 79/183 cut-off events. For 577/850 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 807 event pairs, 10 based on Foata normal form. 20/197 useless extension candidates. Maximal degree in co-relation 669. Up to 89 conditions per place. [2021-03-26 10:03:16,371 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 17 selfloop transitions, 18 changer transitions 0/49 dead transitions. [2021-03-26 10:03:16,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 370 flow [2021-03-26 10:03:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:03:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:03:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-26 10:03:16,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7522727272727273 [2021-03-26 10:03:16,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-26 10:03:16,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-26 10:03:16,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:16,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-26 10:03:16,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,377 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,378 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 252 flow. Second operand 5 states and 662 transitions. [2021-03-26 10:03:16,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 370 flow [2021-03-26 10:03:16,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 344 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-26 10:03:16,381 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 320 flow [2021-03-26 10:03:16,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2021-03-26 10:03:16,381 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-03-26 10:03:16,382 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:16,382 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 320 flow [2021-03-26 10:03:16,382 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 320 flow [2021-03-26 10:03:16,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 320 flow [2021-03-26 10:03:16,403 INFO L129 PetriNetUnfolder]: 64/157 cut-off events. [2021-03-26 10:03:16,404 INFO L130 PetriNetUnfolder]: For 469/584 co-relation queries the response was YES. [2021-03-26 10:03:16,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 157 events. 64/157 cut-off events. For 469/584 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 713 event pairs, 12 based on Foata normal form. 4/149 useless extension candidates. Maximal degree in co-relation 574. Up to 80 conditions per place. [2021-03-26 10:03:16,406 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-26 10:03:16,415 INFO L154 LiptonReduction]: Checked pairs total: 567 [2021-03-26 10:03:16,415 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:16,415 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 10:03:16,417 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 320 flow [2021-03-26 10:03:16,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:16,417 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:16,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:03:16,417 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-26 10:03:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash -266490463, now seen corresponding path program 1 times [2021-03-26 10:03:16,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:16,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504773215] [2021-03-26 10:03:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:16,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:16,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504773215] [2021-03-26 10:03:16,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:16,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:16,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802237752] [2021-03-26 10:03:16,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:16,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:16,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:16,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:16,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 176 [2021-03-26 10:03:16,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:16,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 176 [2021-03-26 10:03:16,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:16,575 INFO L129 PetriNetUnfolder]: 115/277 cut-off events. [2021-03-26 10:03:16,575 INFO L130 PetriNetUnfolder]: For 578/682 co-relation queries the response was YES. [2021-03-26 10:03:16,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 277 events. 115/277 cut-off events. For 578/682 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1462 event pairs, 41 based on Foata normal form. 68/332 useless extension candidates. Maximal degree in co-relation 889. Up to 121 conditions per place. [2021-03-26 10:03:16,578 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 9 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2021-03-26 10:03:16,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 341 flow [2021-03-26 10:03:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:03:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:03:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2021-03-26 10:03:16,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8386363636363636 [2021-03-26 10:03:16,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2021-03-26 10:03:16,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2021-03-26 10:03:16,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:16,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2021-03-26 10:03:16,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,585 INFO L185 Difference]: Start difference. First operand has 50 places, 44 transitions, 320 flow. Second operand 5 states and 738 transitions. [2021-03-26 10:03:16,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 341 flow [2021-03-26 10:03:16,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 329 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:03:16,590 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 339 flow [2021-03-26 10:03:16,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2021-03-26 10:03:16,590 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-26 10:03:16,590 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:16,590 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 339 flow [2021-03-26 10:03:16,590 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 339 flow [2021-03-26 10:03:16,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 339 flow [2021-03-26 10:03:16,623 INFO L129 PetriNetUnfolder]: 121/276 cut-off events. [2021-03-26 10:03:16,624 INFO L130 PetriNetUnfolder]: For 702/796 co-relation queries the response was YES. [2021-03-26 10:03:16,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 276 events. 121/276 cut-off events. For 702/796 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1451 event pairs, 34 based on Foata normal form. 22/274 useless extension candidates. Maximal degree in co-relation 982. Up to 120 conditions per place. [2021-03-26 10:03:16,628 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-26 10:03:16,636 INFO L154 LiptonReduction]: Checked pairs total: 380 [2021-03-26 10:03:16,637 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:03:16,637 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-26 10:03:16,637 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 339 flow [2021-03-26 10:03:16,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,638 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:16,638 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:16,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:03:16,638 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-26 10:03:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash -601391862, now seen corresponding path program 1 times [2021-03-26 10:03:16,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:16,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937384830] [2021-03-26 10:03:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:16,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:16,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937384830] [2021-03-26 10:03:16,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:16,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:03:16,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749809346] [2021-03-26 10:03:16,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:03:16,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:03:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:03:16,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 176 [2021-03-26 10:03:16,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:16,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 176 [2021-03-26 10:03:16,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:16,786 INFO L129 PetriNetUnfolder]: 59/188 cut-off events. [2021-03-26 10:03:16,786 INFO L130 PetriNetUnfolder]: For 609/878 co-relation queries the response was YES. [2021-03-26 10:03:16,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 188 events. 59/188 cut-off events. For 609/878 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 963 event pairs, 7 based on Foata normal form. 128/305 useless extension candidates. Maximal degree in co-relation 725. Up to 95 conditions per place. [2021-03-26 10:03:16,788 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 15 changer transitions 3/55 dead transitions. [2021-03-26 10:03:16,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 416 flow [2021-03-26 10:03:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:03:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:03:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2021-03-26 10:03:16,791 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2021-03-26 10:03:16,791 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions. [2021-03-26 10:03:16,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions. [2021-03-26 10:03:16,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:16,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions. [2021-03-26 10:03:16,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,796 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,796 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 339 flow. Second operand 7 states and 1033 transitions. [2021-03-26 10:03:16,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 416 flow [2021-03-26 10:03:16,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 396 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:03:16,800 INFO L241 Difference]: Finished difference. Result has 62 places, 52 transitions, 391 flow [2021-03-26 10:03:16,800 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2021-03-26 10:03:16,800 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2021-03-26 10:03:16,800 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:16,800 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 52 transitions, 391 flow [2021-03-26 10:03:16,800 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 52 transitions, 391 flow [2021-03-26 10:03:16,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 52 transitions, 391 flow [2021-03-26 10:03:16,821 INFO L129 PetriNetUnfolder]: 57/180 cut-off events. [2021-03-26 10:03:16,821 INFO L130 PetriNetUnfolder]: For 627/723 co-relation queries the response was YES. [2021-03-26 10:03:16,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 180 events. 57/180 cut-off events. For 627/723 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 977 event pairs, 8 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 733. Up to 88 conditions per place. [2021-03-26 10:03:16,824 INFO L142 LiptonReduction]: Number of co-enabled transitions 556 [2021-03-26 10:03:16,836 INFO L154 LiptonReduction]: Checked pairs total: 833 [2021-03-26 10:03:16,837 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:03:16,837 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-26 10:03:16,837 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 375 flow [2021-03-26 10:03:16,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,838 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:16,839 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-26 10:03:16,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:03:16,839 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-26 10:03:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1135192267, now seen corresponding path program 1 times [2021-03-26 10:03:16,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:16,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952215365] [2021-03-26 10:03:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:16,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:16,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:16,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:16,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952215365] [2021-03-26 10:03:16,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:16,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:03:16,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672505073] [2021-03-26 10:03:16,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:03:16,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:03:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:03:16,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 176 [2021-03-26 10:03:16,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:16,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:16,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 176 [2021-03-26 10:03:16,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:17,001 INFO L129 PetriNetUnfolder]: 30/101 cut-off events. [2021-03-26 10:03:17,001 INFO L130 PetriNetUnfolder]: For 392/442 co-relation queries the response was YES. [2021-03-26 10:03:17,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 101 events. 30/101 cut-off events. For 392/442 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 341 event pairs, 1 based on Foata normal form. 20/116 useless extension candidates. Maximal degree in co-relation 401. Up to 43 conditions per place. [2021-03-26 10:03:17,003 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 2 selfloop transitions, 11 changer transitions 3/48 dead transitions. [2021-03-26 10:03:17,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 48 transitions, 380 flow [2021-03-26 10:03:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:03:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:03:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1026 transitions. [2021-03-26 10:03:17,006 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8327922077922078 [2021-03-26 10:03:17,006 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1026 transitions. [2021-03-26 10:03:17,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1026 transitions. [2021-03-26 10:03:17,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:17,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1026 transitions. [2021-03-26 10:03:17,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.57142857142858) internal successors, (1026), 7 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:17,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:17,011 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:17,012 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 375 flow. Second operand 7 states and 1026 transitions. [2021-03-26 10:03:17,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 48 transitions, 380 flow [2021-03-26 10:03:17,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 342 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-03-26 10:03:17,015 INFO L241 Difference]: Finished difference. Result has 60 places, 45 transitions, 322 flow [2021-03-26 10:03:17,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2021-03-26 10:03:17,015 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2021-03-26 10:03:17,016 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:17,016 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 45 transitions, 322 flow [2021-03-26 10:03:17,016 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 45 transitions, 322 flow [2021-03-26 10:03:17,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 45 transitions, 322 flow [2021-03-26 10:03:17,027 INFO L129 PetriNetUnfolder]: 28/95 cut-off events. [2021-03-26 10:03:17,027 INFO L130 PetriNetUnfolder]: For 229/262 co-relation queries the response was YES. [2021-03-26 10:03:17,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 95 events. 28/95 cut-off events. For 229/262 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 333 event pairs, 2 based on Foata normal form. 3/94 useless extension candidates. Maximal degree in co-relation 347. Up to 24 conditions per place. [2021-03-26 10:03:17,029 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-26 10:03:17,285 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:03:17,428 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:03:18,013 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:03:18,244 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:03:19,589 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 349 DAG size of output: 270 [2021-03-26 10:03:20,051 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:03:20,058 INFO L154 LiptonReduction]: Checked pairs total: 964 [2021-03-26 10:03:20,058 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:03:20,058 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3043 [2021-03-26 10:03:20,059 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 308 flow [2021-03-26 10:03:20,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,059 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:20,059 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:20,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:03:20,060 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-26 10:03:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1751940722, now seen corresponding path program 1 times [2021-03-26 10:03:20,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:20,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849543859] [2021-03-26 10:03:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:20,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:20,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:20,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:20,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:20,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849543859] [2021-03-26 10:03:20,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:20,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:03:20,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671826804] [2021-03-26 10:03:20,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:03:20,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:03:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:03:20,099 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 178 [2021-03-26 10:03:20,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:20,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 178 [2021-03-26 10:03:20,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:20,129 INFO L129 PetriNetUnfolder]: 53/161 cut-off events. [2021-03-26 10:03:20,129 INFO L130 PetriNetUnfolder]: For 569/634 co-relation queries the response was YES. [2021-03-26 10:03:20,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 161 events. 53/161 cut-off events. For 569/634 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 738 event pairs, 2 based on Foata normal form. 30/182 useless extension candidates. Maximal degree in co-relation 589. Up to 47 conditions per place. [2021-03-26 10:03:20,131 INFO L132 encePairwiseOnDemand]: 175/178 looper letters, 5 selfloop transitions, 2 changer transitions 6/44 dead transitions. [2021-03-26 10:03:20,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 44 transitions, 326 flow [2021-03-26 10:03:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:03:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:03:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-03-26 10:03:20,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8632958801498127 [2021-03-26 10:03:20,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-03-26 10:03:20,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-03-26 10:03:20,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:20,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-03-26 10:03:20,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,136 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 308 flow. Second operand 3 states and 461 transitions. [2021-03-26 10:03:20,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 44 transitions, 326 flow [2021-03-26 10:03:20,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 284 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 10:03:20,139 INFO L241 Difference]: Finished difference. Result has 52 places, 37 transitions, 229 flow [2021-03-26 10:03:20,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2021-03-26 10:03:20,139 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-26 10:03:20,139 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:20,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 37 transitions, 229 flow [2021-03-26 10:03:20,139 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 37 transitions, 229 flow [2021-03-26 10:03:20,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 37 transitions, 229 flow [2021-03-26 10:03:20,152 INFO L129 PetriNetUnfolder]: 39/119 cut-off events. [2021-03-26 10:03:20,152 INFO L130 PetriNetUnfolder]: For 216/255 co-relation queries the response was YES. [2021-03-26 10:03:20,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 119 events. 39/119 cut-off events. For 216/255 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 4 based on Foata normal form. 11/124 useless extension candidates. Maximal degree in co-relation 376. Up to 36 conditions per place. [2021-03-26 10:03:20,153 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-26 10:03:20,363 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:03:20,751 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:03:20,854 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:03:20,860 INFO L154 LiptonReduction]: Checked pairs total: 271 [2021-03-26 10:03:20,860 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:03:20,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 721 [2021-03-26 10:03:20,860 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 236 flow [2021-03-26 10:03:20,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:20,861 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:20,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:03:20,861 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-26 10:03:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1625353924, now seen corresponding path program 1 times [2021-03-26 10:03:20,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:20,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58854325] [2021-03-26 10:03:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:03:20,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:20,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:03:20,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:20,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:20,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:03:20,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:03:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:03:20,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58854325] [2021-03-26 10:03:20,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:03:20,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:03:20,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204353535] [2021-03-26 10:03:20,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:03:20,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:03:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:03:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:03:20,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 179 [2021-03-26 10:03:20,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:03:20,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 179 [2021-03-26 10:03:20,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:03:20,952 INFO L129 PetriNetUnfolder]: 76/232 cut-off events. [2021-03-26 10:03:20,953 INFO L130 PetriNetUnfolder]: For 565/634 co-relation queries the response was YES. [2021-03-26 10:03:20,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 232 events. 76/232 cut-off events. For 565/634 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1244 event pairs, 3 based on Foata normal form. 31/250 useless extension candidates. Maximal degree in co-relation 760. Up to 72 conditions per place. [2021-03-26 10:03:20,954 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 3 selfloop transitions, 1 changer transitions 6/38 dead transitions. [2021-03-26 10:03:20,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 38 transitions, 248 flow [2021-03-26 10:03:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:03:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:03:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2021-03-26 10:03:20,957 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8296089385474861 [2021-03-26 10:03:20,957 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2021-03-26 10:03:20,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2021-03-26 10:03:20,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:03:20,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2021-03-26 10:03:20,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,960 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:20,960 INFO L185 Difference]: Start difference. First operand has 52 places, 37 transitions, 236 flow. Second operand 4 states and 594 transitions. [2021-03-26 10:03:20,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 38 transitions, 248 flow [2021-03-26 10:03:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 226 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-26 10:03:20,963 INFO L241 Difference]: Finished difference. Result has 52 places, 32 transitions, 189 flow [2021-03-26 10:03:20,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2021-03-26 10:03:20,964 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-26 10:03:20,964 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:03:20,964 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 189 flow [2021-03-26 10:03:20,964 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 32 transitions, 189 flow [2021-03-26 10:03:20,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 189 flow [2021-03-26 10:03:20,972 INFO L129 PetriNetUnfolder]: 19/66 cut-off events. [2021-03-26 10:03:20,972 INFO L130 PetriNetUnfolder]: For 101/111 co-relation queries the response was YES. [2021-03-26 10:03:20,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 66 events. 19/66 cut-off events. For 101/111 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 167 event pairs, 2 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 204. Up to 20 conditions per place. [2021-03-26 10:03:20,972 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-26 10:03:21,291 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 10:03:21,549 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 10:03:21,601 INFO L154 LiptonReduction]: Checked pairs total: 50 [2021-03-26 10:03:21,601 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:03:21,602 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 638 [2021-03-26 10:03:21,602 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 191 flow [2021-03-26 10:03:21,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:03:21,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:03:21,602 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:03:21,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:03:21,603 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:03:21,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:03:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1395716082, now seen corresponding path program 2 times [2021-03-26 10:03:21,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:03:21,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636581589] [2021-03-26 10:03:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:03:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:03:21,640 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:03:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:03:21,671 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:03:21,710 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:03:21,710 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:03:21,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:03:21,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:03:21 BasicIcfg [2021-03-26 10:03:21,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:03:21,821 INFO L168 Benchmark]: Toolchain (without parser) took 22362.23 ms. Allocated memory was 255.9 MB in the beginning and 775.9 MB in the end (delta: 520.1 MB). Free memory was 234.2 MB in the beginning and 617.8 MB in the end (delta: -383.6 MB). Peak memory consumption was 135.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:03:21,821 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:03:21,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.82 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 233.8 MB in the beginning and 330.5 MB in the end (delta: -96.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:03:21,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.17 ms. Allocated memory is still 371.2 MB. Free memory was 330.5 MB in the beginning and 327.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:03:21,822 INFO L168 Benchmark]: Boogie Preprocessor took 56.40 ms. Allocated memory is still 371.2 MB. Free memory was 327.2 MB in the beginning and 325.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:03:21,822 INFO L168 Benchmark]: RCFGBuilder took 1754.81 ms. Allocated memory is still 371.2 MB. Free memory was 325.1 MB in the beginning and 312.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:03:21,823 INFO L168 Benchmark]: TraceAbstraction took 19969.49 ms. Allocated memory was 371.2 MB in the beginning and 775.9 MB in the end (delta: 404.8 MB). Free memory was 311.8 MB in the beginning and 617.8 MB in the end (delta: -306.1 MB). Peak memory consumption was 98.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:03:21,824 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.52 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 494.82 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 233.8 MB in the beginning and 330.5 MB in the end (delta: -96.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.17 ms. Allocated memory is still 371.2 MB. Free memory was 330.5 MB in the beginning and 327.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.40 ms. Allocated memory is still 371.2 MB. Free memory was 327.2 MB in the beginning and 325.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1754.81 ms. Allocated memory is still 371.2 MB. Free memory was 325.1 MB in the beginning and 312.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19969.49 ms. Allocated memory was 371.2 MB in the beginning and 775.9 MB in the end (delta: 404.8 MB). Free memory was 311.8 MB in the beginning and 617.8 MB in the end (delta: -306.1 MB). Peak memory consumption was 98.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8118.9ms, 104 PlacesBefore, 48 PlacesAfterwards, 96 TransitionsBefore, 39 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 3423 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1517, positive: 1425, positive conditional: 1425, positive unconditional: 0, negative: 92, negative conditional: 92, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1517, positive: 1425, positive conditional: 0, positive unconditional: 1425, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1517, positive: 1425, positive conditional: 0, positive unconditional: 1425, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1227, positive: 1180, positive conditional: 0, positive unconditional: 1180, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1227, positive: 1174, positive conditional: 0, positive unconditional: 1174, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 785, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 768, negative conditional: 0, negative unconditional: 768, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1517, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 1227, unknown conditional: 0, unknown unconditional: 1227] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1180, Positive conditional cache size: 0, Positive unconditional cache size: 1180, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3284.1ms, 45 PlacesBefore, 33 PlacesAfterwards, 33 TransitionsBefore, 24 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1380 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, positive: 178, positive conditional: 178, positive unconditional: 0, negative: 95, negative conditional: 95, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, positive: 178, positive conditional: 28, positive unconditional: 150, negative: 95, negative conditional: 4, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, positive: 178, positive conditional: 28, positive unconditional: 150, negative: 95, negative conditional: 4, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, positive: 47, positive conditional: 5, positive unconditional: 42, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 571, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 539, negative conditional: 73, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 273, positive: 131, positive conditional: 23, positive unconditional: 108, negative: 73, negative conditional: 2, negative unconditional: 71, unknown: 69, unknown conditional: 7, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1227, Positive conditional cache size: 5, Positive unconditional cache size: 1222, Negative cache size: 69, Negative conditional cache size: 2, Negative unconditional cache size: 67, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 842.2ms, 34 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 588 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1237, Positive conditional cache size: 5, Positive unconditional cache size: 1232, Negative cache size: 70, Negative conditional cache size: 2, Negative unconditional cache size: 68, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 186 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, positive: 67, positive conditional: 14, positive unconditional: 53, negative: 11, negative conditional: 2, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 67, positive conditional: 14, positive unconditional: 53, negative: 11, negative conditional: 2, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 57, positive conditional: 12, positive unconditional: 45, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1247, Positive conditional cache size: 7, Positive unconditional cache size: 1240, Negative cache size: 72, Negative conditional cache size: 4, Negative unconditional cache size: 68, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.7ms, 40 PlacesBefore, 40 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, positive: 93, positive conditional: 19, positive unconditional: 74, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 93, positive conditional: 19, positive unconditional: 74, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 88, positive conditional: 17, positive unconditional: 71, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1252, Positive conditional cache size: 9, Positive unconditional cache size: 1243, Negative cache size: 72, Negative conditional cache size: 4, Negative unconditional cache size: 68, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, positive: 88, positive conditional: 24, positive unconditional: 64, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 88, positive conditional: 24, positive unconditional: 64, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, positive: 88, positive conditional: 24, positive unconditional: 64, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1252, Positive conditional cache size: 9, Positive unconditional cache size: 1243, Negative cache size: 72, Negative conditional cache size: 4, Negative unconditional cache size: 68, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 124.6ms, 46 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 487 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, positive: 66, positive conditional: 13, positive unconditional: 53, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 66, positive conditional: 13, positive unconditional: 53, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, positive: 63, positive conditional: 13, positive unconditional: 50, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1255, Positive conditional cache size: 9, Positive unconditional cache size: 1246, Negative cache size: 75, Negative conditional cache size: 4, Negative unconditional cache size: 71, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.1ms, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 567 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, positive: 125, positive conditional: 125, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, positive: 125, positive conditional: 59, positive unconditional: 66, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, positive: 125, positive conditional: 59, positive unconditional: 66, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, positive: 119, positive conditional: 57, positive unconditional: 62, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1261, Positive conditional cache size: 11, Positive unconditional cache size: 1250, Negative cache size: 75, Negative conditional cache size: 4, Negative unconditional cache size: 71, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.3ms, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 380 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, positive: 129, positive conditional: 70, positive unconditional: 59, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 129, positive conditional: 70, positive unconditional: 59, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 5, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, positive: 121, positive conditional: 65, positive unconditional: 56, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1344, Positive cache size: 1269, Positive conditional cache size: 16, Positive unconditional cache size: 1253, Negative cache size: 75, Negative conditional cache size: 4, Negative unconditional cache size: 71, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.3ms, 62 PlacesBefore, 62 PlacesAfterwards, 52 TransitionsBefore, 50 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 833 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 220, positive: 190, positive conditional: 190, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 220, positive: 190, positive conditional: 134, positive unconditional: 56, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 220, positive: 190, positive conditional: 134, positive unconditional: 56, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 220, positive: 184, positive conditional: 129, positive unconditional: 55, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1275, Positive conditional cache size: 21, Positive unconditional cache size: 1254, Negative cache size: 75, Negative conditional cache size: 4, Negative unconditional cache size: 71, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3042.4ms, 60 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 964 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 488, positive: 437, positive conditional: 437, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 488, positive: 437, positive conditional: 320, positive unconditional: 117, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 488, positive: 437, positive conditional: 320, positive unconditional: 117, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 488, positive: 424, positive conditional: 308, positive unconditional: 116, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1364, Positive cache size: 1288, Positive conditional cache size: 33, Positive unconditional cache size: 1255, Negative cache size: 76, Negative conditional cache size: 4, Negative unconditional cache size: 72, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 720.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 271 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, positive: 100, positive conditional: 57, positive unconditional: 43, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 100, positive conditional: 57, positive unconditional: 43, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, positive: 93, positive conditional: 54, positive unconditional: 39, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1371, Positive cache size: 1295, Positive conditional cache size: 36, Positive unconditional cache size: 1259, Negative cache size: 76, Negative conditional cache size: 4, Negative unconditional cache size: 72, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 637.2ms, 52 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 50 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, positive: 50, positive conditional: 13, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 50, positive conditional: 13, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 39, positive conditional: 10, positive unconditional: 29, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1306, Positive conditional cache size: 39, Positive unconditional cache size: 1267, Negative cache size: 76, Negative conditional cache size: 4, Negative unconditional cache size: 72, Eliminated conditions: 26 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t760; [L824] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t761; [L826] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t762; [L828] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19730.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1064.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8207.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 15 SDslu, 13 SDs, 0 SdLazy, 221 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 305.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 221.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=9, InterpolantAutomatonStates: 53, 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: 40.8ms SsaConstructionTime, 459.2ms SatisfiabilityAnalysisTime, 751.3ms InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...