/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:39:12,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:39:12,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:39:12,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:39:12,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:39:12,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:39:12,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:39:12,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:39:12,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:39:12,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:39:12,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:39:12,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:39:12,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:39:12,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:39:12,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:39:12,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:39:12,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:39:12,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:39:12,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:39:12,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:39:12,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:39:12,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:39:12,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:39:12,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:39:12,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:39:12,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:39:12,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:39:12,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:39:12,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:39:12,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:39:12,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:39:12,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:39:12,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:39:12,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:39:12,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:39:12,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:39:12,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:39:12,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:39:12,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:39:12,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:39:12,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:39:12,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:39:12,354 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:39:12,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:39:12,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:39:12,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:39:12,358 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:39:12,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:39:12,359 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:39:12,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:39:12,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:39:12,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:39:12,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:39:12,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:39:12,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:39:12,361 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:39:12,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:39:12,361 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:39:12,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:39:12,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:39:12,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:39:12,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:39:12,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:39:12,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:39:12,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:39:12,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:39:12,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:39:12,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:39:12,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:39:12,364 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:39:12,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:39:12,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:39:12,364 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:39:12,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:39:12,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:39:12,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:39:12,764 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:39:12,764 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:39:12,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2021-03-26 00:39:12,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ce3b5c7/11b14f3bf1af43899d2fc8dd46828324/FLAG9c376ac18 [2021-03-26 00:39:13,369 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:39:13,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2021-03-26 00:39:13,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ce3b5c7/11b14f3bf1af43899d2fc8dd46828324/FLAG9c376ac18 [2021-03-26 00:39:13,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ce3b5c7/11b14f3bf1af43899d2fc8dd46828324 [2021-03-26 00:39:13,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:39:13,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:39:13,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:39:13,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:39:13,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:39:13,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:39:13" (1/1) ... [2021-03-26 00:39:13,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ba9446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:13, skipping insertion in model container [2021-03-26 00:39:13,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:39:13" (1/1) ... [2021-03-26 00:39:13,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:39:13,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:39:13,866 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/safe011_rmo.oepc.i[950,963] [2021-03-26 00:39:14,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:39:14,080 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:39:14,098 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/safe011_rmo.oepc.i[950,963] [2021-03-26 00:39:14,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:39:14,205 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:39:14,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14 WrapperNode [2021-03-26 00:39:14,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:39:14,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:39:14,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:39:14,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:39:14,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:39:14,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:39:14,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:39:14,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:39:14,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... [2021-03-26 00:39:14,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:39:14,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:39:14,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:39:14,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:39:14,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:39:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:39:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:39:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:39:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:39:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:39:14,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:39:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:39:14,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:39:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:39:14,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:39:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:39:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:39:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:39:14,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:39:14,404 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:39:16,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:39:16,316 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:39:16,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:39:16 BoogieIcfgContainer [2021-03-26 00:39:16,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:39:16,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:39:16,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:39:16,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:39:16,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:39:13" (1/3) ... [2021-03-26 00:39:16,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce924fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:39:16, skipping insertion in model container [2021-03-26 00:39:16,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:39:14" (2/3) ... [2021-03-26 00:39:16,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce924fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:39:16, skipping insertion in model container [2021-03-26 00:39:16,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:39:16" (3/3) ... [2021-03-26 00:39:16,326 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2021-03-26 00:39:16,332 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:39:16,337 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:39:16,338 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:39:16,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,371 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,371 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,386 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,386 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,390 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,394 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:39:16,404 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:39:16,422 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:39:16,455 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:39:16,456 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:39:16,456 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:39:16,456 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:39:16,456 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:39:16,456 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:39:16,456 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:39:16,456 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:39:16,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:39:16,520 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:39:16,520 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:16,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:39:16,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:39:16,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:16,538 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:16,551 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:16,553 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:16,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:39:16,574 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:39:16,574 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:16,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:39:16,577 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:39:18,398 WARN L205 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 00:39:18,781 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 00:39:20,352 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 00:39:20,946 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:39:21,139 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:39:21,591 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:39:21,719 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:39:22,718 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:39:23,119 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:39:23,712 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:39:24,333 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:39:24,587 INFO L154 LiptonReduction]: Checked pairs total: 3065 [2021-03-26 00:39:24,587 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:39:24,589 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8052 [2021-03-26 00:39:24,598 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-26 00:39:24,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:24,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:24,599 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:24,599 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:24,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1571617397, now seen corresponding path program 1 times [2021-03-26 00:39:24,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:24,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510597883] [2021-03-26 00:39:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:24,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:24,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:24,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:24,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:24,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510597883] [2021-03-26 00:39:24,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:24,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:39:24,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973177936] [2021-03-26 00:39:24,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:39:24,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:39:24,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:39:24,876 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 161 [2021-03-26 00:39:24,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:24,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:24,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 161 [2021-03-26 00:39:24,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:25,019 INFO L129 PetriNetUnfolder]: 69/200 cut-off events. [2021-03-26 00:39:25,019 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:25,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 200 events. 69/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 953 event pairs, 54 based on Foata normal form. 11/193 useless extension candidates. Maximal degree in co-relation 309. Up to 89 conditions per place. [2021-03-26 00:39:25,022 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-26 00:39:25,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 00:39:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2021-03-26 00:39:25,040 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8964803312629399 [2021-03-26 00:39:25,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2021-03-26 00:39:25,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2021-03-26 00:39:25,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:25,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2021-03-26 00:39:25,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:25,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:25,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:25,067 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 433 transitions. [2021-03-26 00:39:25,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 00:39:25,070 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 00:39:25,072 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-26 00:39:25,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, 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=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 00:39:25,075 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 00:39:25,075 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:25,075 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 00:39:25,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 00:39:25,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-26 00:39:25,082 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 00:39:25,082 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:25,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:39:25,084 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:39:25,787 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:39:26,137 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:39:26,823 WARN L205 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:39:27,435 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:39:27,884 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-26 00:39:28,058 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-26 00:39:28,110 INFO L154 LiptonReduction]: Checked pairs total: 942 [2021-03-26 00:39:28,110 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 00:39:28,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3035 [2021-03-26 00:39:28,112 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:39:28,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:28,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:28,112 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:28,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:39:28,113 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:28,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:28,113 INFO L82 PathProgramCache]: Analyzing trace with hash -72729481, now seen corresponding path program 1 times [2021-03-26 00:39:28,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:28,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051520678] [2021-03-26 00:39:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:28,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:28,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:28,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:28,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:28,210 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:39:28,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:39:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:28,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051520678] [2021-03-26 00:39:28,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:28,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:28,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937994612] [2021-03-26 00:39:28,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:28,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:28,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:28,218 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 169 [2021-03-26 00:39:28,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:28,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:28,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 169 [2021-03-26 00:39:28,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:28,242 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-26 00:39:28,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:28,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-26 00:39:28,243 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:39:28,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 74 flow [2021-03-26 00:39:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2021-03-26 00:39:28,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445 [2021-03-26 00:39:28,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2021-03-26 00:39:28,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2021-03-26 00:39:28,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:28,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2021-03-26 00:39:28,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:28,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:28,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:28,249 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 436 transitions. [2021-03-26 00:39:28,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 74 flow [2021-03-26 00:39:28,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:28,250 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 73 flow [2021-03-26 00:39:28,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 00:39:28,251 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 00:39:28,251 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:28,251 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 00:39:28,251 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 00:39:28,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 73 flow [2021-03-26 00:39:28,256 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 00:39:28,256 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:39:28,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 00:39:28,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-26 00:39:28,821 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:39:28,953 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:39:29,242 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:39:29,374 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:39:29,377 INFO L154 LiptonReduction]: Checked pairs total: 774 [2021-03-26 00:39:29,378 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:39:29,378 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1127 [2021-03-26 00:39:29,379 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-03-26 00:39:29,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:29,380 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:29,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:39:29,380 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash -999718679, now seen corresponding path program 1 times [2021-03-26 00:39:29,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:29,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314781980] [2021-03-26 00:39:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:29,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:29,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:29,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314781980] [2021-03-26 00:39:29,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:29,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:39:29,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176383165] [2021-03-26 00:39:29,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:39:29,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:39:29,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:39:29,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2021-03-26 00:39:29,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:29,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2021-03-26 00:39:29,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:29,474 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 00:39:29,474 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 00:39:29,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 34 events. 3/34 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2021-03-26 00:39:29,475 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-26 00:39:29,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2021-03-26 00:39:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 00:39:29,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8908382066276803 [2021-03-26 00:39:29,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 00:39:29,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 00:39:29,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:29,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 00:39:29,480 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 00:39:29,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,482 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 457 transitions. [2021-03-26 00:39:29,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2021-03-26 00:39:29,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:29,483 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-03-26 00:39:29,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=66, 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=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-26 00:39:29,483 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 00:39:29,483 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:29,483 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-26 00:39:29,483 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-26 00:39:29,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-03-26 00:39:29,488 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 00:39:29,488 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:39:29,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 00:39:29,489 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-26 00:39:29,494 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 00:39:29,494 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:29,494 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 00:39:29,495 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-03-26 00:39:29,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:29,496 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:29,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:39:29,496 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash 476868744, now seen corresponding path program 1 times [2021-03-26 00:39:29,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:29,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639925501] [2021-03-26 00:39:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:29,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:29,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:29,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:29,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:29,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639925501] [2021-03-26 00:39:29,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:29,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:39:29,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660470222] [2021-03-26 00:39:29,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:29,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:29,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:29,548 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2021-03-26 00:39:29,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:29,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2021-03-26 00:39:29,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:29,575 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-26 00:39:29,575 INFO L130 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2021-03-26 00:39:29,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 43 events. 2/43 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 4/45 useless extension candidates. Maximal degree in co-relation 69. Up to 8 conditions per place. [2021-03-26 00:39:29,576 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-26 00:39:29,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2021-03-26 00:39:29,578 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581871345029239 [2021-03-26 00:39:29,578 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2021-03-26 00:39:29,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2021-03-26 00:39:29,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:29,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2021-03-26 00:39:29,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,582 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,582 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 4 states and 587 transitions. [2021-03-26 00:39:29,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 83 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:29,584 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 00:39:29,584 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-26 00:39:29,584 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:29,584 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,590 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-26 00:39:29,590 INFO L130 PetriNetUnfolder]: For 13/16 co-relation queries the response was YES. [2021-03-26 00:39:29,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 43 events. 2/43 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 74. Up to 8 conditions per place. [2021-03-26 00:39:29,592 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-26 00:39:29,715 INFO L154 LiptonReduction]: Checked pairs total: 258 [2021-03-26 00:39:29,716 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:29,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-03-26 00:39:29,717 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 89 flow [2021-03-26 00:39:29,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:29,717 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:29,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:39:29,718 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1062075708, now seen corresponding path program 1 times [2021-03-26 00:39:29,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:29,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488823046] [2021-03-26 00:39:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:29,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:29,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:29,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:29,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:29,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488823046] [2021-03-26 00:39:29,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:29,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:39:29,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574054011] [2021-03-26 00:39:29,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:29,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:29,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:29,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-26 00:39:29,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:29,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-26 00:39:29,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:29,888 INFO L129 PetriNetUnfolder]: 151/318 cut-off events. [2021-03-26 00:39:29,888 INFO L130 PetriNetUnfolder]: For 288/318 co-relation queries the response was YES. [2021-03-26 00:39:29,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 318 events. 151/318 cut-off events. For 288/318 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1622 event pairs, 51 based on Foata normal form. 14/314 useless extension candidates. Maximal degree in co-relation 685. Up to 243 conditions per place. [2021-03-26 00:39:29,891 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 9 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2021-03-26 00:39:29,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 137 flow [2021-03-26 00:39:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2021-03-26 00:39:29,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7923976608187134 [2021-03-26 00:39:29,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2021-03-26 00:39:29,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2021-03-26 00:39:29,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:29,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2021-03-26 00:39:29,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:29,897 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 89 flow. Second operand 4 states and 542 transitions. [2021-03-26 00:39:29,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 137 flow [2021-03-26 00:39:29,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:29,899 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 131 flow [2021-03-26 00:39:29,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-26 00:39:29,899 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 00:39:29,899 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:29,900 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 131 flow [2021-03-26 00:39:29,900 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 131 flow [2021-03-26 00:39:29,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 131 flow [2021-03-26 00:39:29,912 INFO L129 PetriNetUnfolder]: 20/110 cut-off events. [2021-03-26 00:39:29,912 INFO L130 PetriNetUnfolder]: For 96/101 co-relation queries the response was YES. [2021-03-26 00:39:29,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 110 events. 20/110 cut-off events. For 96/101 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 555 event pairs, 1 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 236. Up to 31 conditions per place. [2021-03-26 00:39:29,914 INFO L142 LiptonReduction]: Number of co-enabled transitions 352 [2021-03-26 00:39:29,973 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-26 00:39:29,974 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:29,974 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-26 00:39:29,977 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 131 flow [2021-03-26 00:39:29,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,004 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:30,005 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:30,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:39:30,005 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2056140589, now seen corresponding path program 1 times [2021-03-26 00:39:30,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:30,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061831628] [2021-03-26 00:39:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:30,143 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:39:30,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:39:30,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:30,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:39:30,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:30,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:39:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:30,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061831628] [2021-03-26 00:39:30,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:30,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:30,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520335719] [2021-03-26 00:39:30,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:39:30,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:30,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:39:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:39:30,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 171 [2021-03-26 00:39:30,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:30,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 171 [2021-03-26 00:39:30,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:30,302 INFO L129 PetriNetUnfolder]: 148/315 cut-off events. [2021-03-26 00:39:30,302 INFO L130 PetriNetUnfolder]: For 601/743 co-relation queries the response was YES. [2021-03-26 00:39:30,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 315 events. 148/315 cut-off events. For 601/743 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1599 event pairs, 58 based on Foata normal form. 20/315 useless extension candidates. Maximal degree in co-relation 873. Up to 237 conditions per place. [2021-03-26 00:39:30,305 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 12 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2021-03-26 00:39:30,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 175 flow [2021-03-26 00:39:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:39:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:39:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2021-03-26 00:39:30,307 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7621832358674464 [2021-03-26 00:39:30,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2021-03-26 00:39:30,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2021-03-26 00:39:30,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:30,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2021-03-26 00:39:30,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,310 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 131 flow. Second operand 3 states and 391 transitions. [2021-03-26 00:39:30,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 175 flow [2021-03-26 00:39:30,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 175 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:39:30,312 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 160 flow [2021-03-26 00:39:30,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-26 00:39:30,313 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2021-03-26 00:39:30,313 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:30,313 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 160 flow [2021-03-26 00:39:30,313 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 160 flow [2021-03-26 00:39:30,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 160 flow [2021-03-26 00:39:30,327 INFO L129 PetriNetUnfolder]: 27/127 cut-off events. [2021-03-26 00:39:30,328 INFO L130 PetriNetUnfolder]: For 245/257 co-relation queries the response was YES. [2021-03-26 00:39:30,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 127 events. 27/127 cut-off events. For 245/257 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 645 event pairs, 4 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 324. Up to 35 conditions per place. [2021-03-26 00:39:30,330 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-26 00:39:30,364 INFO L154 LiptonReduction]: Checked pairs total: 106 [2021-03-26 00:39:30,364 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:30,364 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-26 00:39:30,365 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 160 flow [2021-03-26 00:39:30,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:30,366 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:30,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:39:30,366 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1725114341, now seen corresponding path program 1 times [2021-03-26 00:39:30,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:30,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316275075] [2021-03-26 00:39:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:30,435 INFO L142 QuantifierPusher]: treesize reduction 14, result has 44.0 percent of original size [2021-03-26 00:39:30,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:39:30,443 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-03-26 00:39:30,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:39:30,453 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-26 00:39:30,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:39:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:30,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316275075] [2021-03-26 00:39:30,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:30,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:30,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474764336] [2021-03-26 00:39:30,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:39:30,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:39:30,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:39:30,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-26 00:39:30,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 160 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 00:39:30,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:30,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-26 00:39:30,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:30,614 INFO L129 PetriNetUnfolder]: 170/361 cut-off events. [2021-03-26 00:39:30,614 INFO L130 PetriNetUnfolder]: For 926/1085 co-relation queries the response was YES. [2021-03-26 00:39:30,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 361 events. 170/361 cut-off events. For 926/1085 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1917 event pairs, 56 based on Foata normal form. 37/379 useless extension candidates. Maximal degree in co-relation 1043. Up to 213 conditions per place. [2021-03-26 00:39:30,618 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 14 selfloop transitions, 13 changer transitions 0/44 dead transitions. [2021-03-26 00:39:30,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 248 flow [2021-03-26 00:39:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:39:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:39:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2021-03-26 00:39:30,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7929824561403509 [2021-03-26 00:39:30,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2021-03-26 00:39:30,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2021-03-26 00:39:30,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:30,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2021-03-26 00:39:30,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 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 00:39:30,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 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 00:39:30,625 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 160 flow. Second operand 5 states and 678 transitions. [2021-03-26 00:39:30,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 248 flow [2021-03-26 00:39:30,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 237 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:30,630 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 236 flow [2021-03-26 00:39:30,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-26 00:39:30,631 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-26 00:39:30,631 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:30,631 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 236 flow [2021-03-26 00:39:30,631 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 236 flow [2021-03-26 00:39:30,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 236 flow [2021-03-26 00:39:30,679 INFO L129 PetriNetUnfolder]: 148/336 cut-off events. [2021-03-26 00:39:30,679 INFO L130 PetriNetUnfolder]: For 1349/1409 co-relation queries the response was YES. [2021-03-26 00:39:30,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 336 events. 148/336 cut-off events. For 1349/1409 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1848 event pairs, 29 based on Foata normal form. 6/295 useless extension candidates. Maximal degree in co-relation 1167. Up to 164 conditions per place. [2021-03-26 00:39:30,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-26 00:39:30,697 INFO L154 LiptonReduction]: Checked pairs total: 80 [2021-03-26 00:39:30,697 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:30,697 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-26 00:39:30,699 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 236 flow [2021-03-26 00:39:30,699 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 00:39:30,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:30,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:30,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:39:30,699 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash 91985790, now seen corresponding path program 1 times [2021-03-26 00:39:30,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:30,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971269999] [2021-03-26 00:39:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:30,771 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:39:30,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:39:30,803 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.4 percent of original size [2021-03-26 00:39:30,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-03-26 00:39:30,845 INFO L142 QuantifierPusher]: treesize reduction 12, result has 76.5 percent of original size [2021-03-26 00:39:30,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:39:30,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:30,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:39:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:30,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971269999] [2021-03-26 00:39:30,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:30,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:30,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702629788] [2021-03-26 00:39:30,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:30,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:30,906 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 171 [2021-03-26 00:39:30,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:30,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:30,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 171 [2021-03-26 00:39:30,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:31,047 INFO L129 PetriNetUnfolder]: 165/341 cut-off events. [2021-03-26 00:39:31,047 INFO L130 PetriNetUnfolder]: For 1066/1313 co-relation queries the response was YES. [2021-03-26 00:39:31,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 341 events. 165/341 cut-off events. For 1066/1313 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1719 event pairs, 42 based on Foata normal form. 38/361 useless extension candidates. Maximal degree in co-relation 1347. Up to 243 conditions per place. [2021-03-26 00:39:31,051 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 18 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2021-03-26 00:39:31,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 310 flow [2021-03-26 00:39:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:39:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:39:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2021-03-26 00:39:31,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-26 00:39:31,053 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2021-03-26 00:39:31,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2021-03-26 00:39:31,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:31,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2021-03-26 00:39:31,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,056 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,057 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 236 flow. Second operand 4 states and 513 transitions. [2021-03-26 00:39:31,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 310 flow [2021-03-26 00:39:31,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 295 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:31,061 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 263 flow [2021-03-26 00:39:31,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2021-03-26 00:39:31,061 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-26 00:39:31,061 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:31,061 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 263 flow [2021-03-26 00:39:31,062 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 263 flow [2021-03-26 00:39:31,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 263 flow [2021-03-26 00:39:31,105 INFO L129 PetriNetUnfolder]: 148/328 cut-off events. [2021-03-26 00:39:31,105 INFO L130 PetriNetUnfolder]: For 1593/1663 co-relation queries the response was YES. [2021-03-26 00:39:31,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 328 events. 148/328 cut-off events. For 1593/1663 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1812 event pairs, 25 based on Foata normal form. 9/296 useless extension candidates. Maximal degree in co-relation 1169. Up to 160 conditions per place. [2021-03-26 00:39:31,112 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 00:39:31,120 INFO L154 LiptonReduction]: Checked pairs total: 86 [2021-03-26 00:39:31,120 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:31,120 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 00:39:31,123 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 263 flow [2021-03-26 00:39:31,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:31,124 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:31,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:39:31,124 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1603402268, now seen corresponding path program 1 times [2021-03-26 00:39:31,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:31,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967411872] [2021-03-26 00:39:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:31,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:39:31,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:39:31,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:39:31,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:39:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:31,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967411872] [2021-03-26 00:39:31,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:31,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:31,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629727482] [2021-03-26 00:39:31,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:31,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:31,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-26 00:39:31,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:31,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-26 00:39:31,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:31,470 INFO L129 PetriNetUnfolder]: 215/459 cut-off events. [2021-03-26 00:39:31,470 INFO L130 PetriNetUnfolder]: For 2108/2387 co-relation queries the response was YES. [2021-03-26 00:39:31,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 459 events. 215/459 cut-off events. For 2108/2387 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2583 event pairs, 27 based on Foata normal form. 71/512 useless extension candidates. Maximal degree in co-relation 1801. Up to 233 conditions per place. [2021-03-26 00:39:31,475 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 11 selfloop transitions, 30 changer transitions 0/58 dead transitions. [2021-03-26 00:39:31,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 445 flow [2021-03-26 00:39:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:39:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:39:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2021-03-26 00:39:31,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7886382623224728 [2021-03-26 00:39:31,479 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2021-03-26 00:39:31,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2021-03-26 00:39:31,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:31,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2021-03-26 00:39:31,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,484 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,484 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 263 flow. Second operand 7 states and 944 transitions. [2021-03-26 00:39:31,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 445 flow [2021-03-26 00:39:31,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 415 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 00:39:31,491 INFO L241 Difference]: Finished difference. Result has 58 places, 54 transitions, 416 flow [2021-03-26 00:39:31,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2021-03-26 00:39:31,492 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-26 00:39:31,492 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:31,492 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 416 flow [2021-03-26 00:39:31,492 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 54 transitions, 416 flow [2021-03-26 00:39:31,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 416 flow [2021-03-26 00:39:31,565 INFO L129 PetriNetUnfolder]: 209/465 cut-off events. [2021-03-26 00:39:31,566 INFO L130 PetriNetUnfolder]: For 1721/1908 co-relation queries the response was YES. [2021-03-26 00:39:31,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 465 events. 209/465 cut-off events. For 1721/1908 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2800 event pairs, 28 based on Foata normal form. 18/460 useless extension candidates. Maximal degree in co-relation 1901. Up to 211 conditions per place. [2021-03-26 00:39:31,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 544 [2021-03-26 00:39:31,601 INFO L154 LiptonReduction]: Checked pairs total: 251 [2021-03-26 00:39:31,601 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:31,601 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-03-26 00:39:31,602 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 416 flow [2021-03-26 00:39:31,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:31,603 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:31,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:39:31,603 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1094704262, now seen corresponding path program 1 times [2021-03-26 00:39:31,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:31,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558439461] [2021-03-26 00:39:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:31,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:31,661 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:39:31,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:39:31,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:31,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558439461] [2021-03-26 00:39:31,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:31,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:39:31,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350008589] [2021-03-26 00:39:31,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:39:31,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:39:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:39:31,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-26 00:39:31,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:31,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-26 00:39:31,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:31,809 INFO L129 PetriNetUnfolder]: 362/797 cut-off events. [2021-03-26 00:39:31,809 INFO L130 PetriNetUnfolder]: For 2460/2888 co-relation queries the response was YES. [2021-03-26 00:39:31,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 797 events. 362/797 cut-off events. For 2460/2888 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 5400 event pairs, 83 based on Foata normal form. 198/865 useless extension candidates. Maximal degree in co-relation 2739. Up to 417 conditions per place. [2021-03-26 00:39:31,817 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 12 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2021-03-26 00:39:31,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 471 flow [2021-03-26 00:39:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:39:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:39:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2021-03-26 00:39:31,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-03-26 00:39:31,820 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2021-03-26 00:39:31,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2021-03-26 00:39:31,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:31,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2021-03-26 00:39:31,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 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 00:39:31,825 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 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 00:39:31,825 INFO L185 Difference]: Start difference. First operand has 58 places, 54 transitions, 416 flow. Second operand 5 states and 725 transitions. [2021-03-26 00:39:31,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 471 flow [2021-03-26 00:39:31,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 443 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-26 00:39:31,830 INFO L241 Difference]: Finished difference. Result has 62 places, 60 transitions, 449 flow [2021-03-26 00:39:31,831 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=449, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2021-03-26 00:39:31,831 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2021-03-26 00:39:31,831 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:31,832 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 449 flow [2021-03-26 00:39:31,832 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 449 flow [2021-03-26 00:39:31,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 449 flow [2021-03-26 00:39:31,906 INFO L129 PetriNetUnfolder]: 291/675 cut-off events. [2021-03-26 00:39:31,906 INFO L130 PetriNetUnfolder]: For 2591/2823 co-relation queries the response was YES. [2021-03-26 00:39:31,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 675 events. 291/675 cut-off events. For 2591/2823 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4529 event pairs, 67 based on Foata normal form. 68/710 useless extension candidates. Maximal degree in co-relation 2724. Up to 277 conditions per place. [2021-03-26 00:39:31,916 INFO L142 LiptonReduction]: Number of co-enabled transitions 672 [2021-03-26 00:39:31,924 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:39:31,924 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:31,924 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93 [2021-03-26 00:39:31,924 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 449 flow [2021-03-26 00:39:31,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:31,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:31,926 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:31,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:39:31,926 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1860071650, now seen corresponding path program 1 times [2021-03-26 00:39:31,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:31,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044441656] [2021-03-26 00:39:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:31,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:31,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:31,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:31,998 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:39:31,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:39:32,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:32,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:32,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044441656] [2021-03-26 00:39:32,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:32,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:39:32,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043435253] [2021-03-26 00:39:32,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:39:32,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:39:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:39:32,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-26 00:39:32,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 449 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:32,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-26 00:39:32,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:32,138 INFO L129 PetriNetUnfolder]: 216/571 cut-off events. [2021-03-26 00:39:32,138 INFO L130 PetriNetUnfolder]: For 2325/3580 co-relation queries the response was YES. [2021-03-26 00:39:32,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 571 events. 216/571 cut-off events. For 2325/3580 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3996 event pairs, 12 based on Foata normal form. 403/905 useless extension candidates. Maximal degree in co-relation 2252. Up to 286 conditions per place. [2021-03-26 00:39:32,144 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 9 selfloop transitions, 15 changer transitions 3/69 dead transitions. [2021-03-26 00:39:32,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 541 flow [2021-03-26 00:39:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:39:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:39:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1015 transitions. [2021-03-26 00:39:32,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-03-26 00:39:32,147 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1015 transitions. [2021-03-26 00:39:32,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1015 transitions. [2021-03-26 00:39:32,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:32,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1015 transitions. [2021-03-26 00:39:32,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,152 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,152 INFO L185 Difference]: Start difference. First operand has 62 places, 60 transitions, 449 flow. Second operand 7 states and 1015 transitions. [2021-03-26 00:39:32,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 541 flow [2021-03-26 00:39:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 531 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 00:39:32,158 INFO L241 Difference]: Finished difference. Result has 70 places, 64 transitions, 518 flow [2021-03-26 00:39:32,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2021-03-26 00:39:32,159 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2021-03-26 00:39:32,159 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:32,159 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 64 transitions, 518 flow [2021-03-26 00:39:32,159 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 64 transitions, 518 flow [2021-03-26 00:39:32,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 64 transitions, 518 flow [2021-03-26 00:39:32,206 INFO L129 PetriNetUnfolder]: 138/438 cut-off events. [2021-03-26 00:39:32,206 INFO L130 PetriNetUnfolder]: For 2071/2249 co-relation queries the response was YES. [2021-03-26 00:39:32,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 438 events. 138/438 cut-off events. For 2071/2249 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3136 event pairs, 7 based on Foata normal form. 52/479 useless extension candidates. Maximal degree in co-relation 1936. Up to 202 conditions per place. [2021-03-26 00:39:32,214 INFO L142 LiptonReduction]: Number of co-enabled transitions 716 [2021-03-26 00:39:32,220 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:39:32,221 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:32,221 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-26 00:39:32,222 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 518 flow [2021-03-26 00:39:32,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,223 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:32,223 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 00:39:32,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:39:32,223 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2020158054, now seen corresponding path program 1 times [2021-03-26 00:39:32,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:32,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888517980] [2021-03-26 00:39:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:32,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:32,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:32,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:32,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:32,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:32,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:39:32,294 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:39:32,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:39:32,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:32,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:39:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:32,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888517980] [2021-03-26 00:39:32,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:32,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:39:32,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914731165] [2021-03-26 00:39:32,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:39:32,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:32,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:39:32,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:39:32,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-26 00:39:32,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:32,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-26 00:39:32,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:32,475 INFO L129 PetriNetUnfolder]: 187/510 cut-off events. [2021-03-26 00:39:32,475 INFO L130 PetriNetUnfolder]: For 3077/4498 co-relation queries the response was YES. [2021-03-26 00:39:32,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 510 events. 187/510 cut-off events. For 3077/4498 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3556 event pairs, 2 based on Foata normal form. 368/811 useless extension candidates. Maximal degree in co-relation 2288. Up to 268 conditions per place. [2021-03-26 00:39:32,482 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 19 changer transitions 4/70 dead transitions. [2021-03-26 00:39:32,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 596 flow [2021-03-26 00:39:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:39:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:39:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1299 transitions. [2021-03-26 00:39:32,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8440545808966862 [2021-03-26 00:39:32,485 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1299 transitions. [2021-03-26 00:39:32,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1299 transitions. [2021-03-26 00:39:32,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:32,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1299 transitions. [2021-03-26 00:39:32,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.33333333333334) internal successors, (1299), 9 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,492 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:32,492 INFO L185 Difference]: Start difference. First operand has 70 places, 64 transitions, 518 flow. Second operand 9 states and 1299 transitions. [2021-03-26 00:39:32,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 596 flow [2021-03-26 00:39:32,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 524 flow, removed 25 selfloop flow, removed 5 redundant places. [2021-03-26 00:39:32,504 INFO L241 Difference]: Finished difference. Result has 76 places, 64 transitions, 493 flow [2021-03-26 00:39:32,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2021-03-26 00:39:32,504 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2021-03-26 00:39:32,504 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:32,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 64 transitions, 493 flow [2021-03-26 00:39:32,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 64 transitions, 493 flow [2021-03-26 00:39:32,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 64 transitions, 493 flow [2021-03-26 00:39:32,543 INFO L129 PetriNetUnfolder]: 111/380 cut-off events. [2021-03-26 00:39:32,543 INFO L130 PetriNetUnfolder]: For 1566/1670 co-relation queries the response was YES. [2021-03-26 00:39:32,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 380 events. 111/380 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2752 event pairs, 0 based on Foata normal form. 35/403 useless extension candidates. Maximal degree in co-relation 1555. Up to 85 conditions per place. [2021-03-26 00:39:32,549 INFO L142 LiptonReduction]: Number of co-enabled transitions 696 [2021-03-26 00:39:32,862 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:39:33,012 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:39:33,678 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-26 00:39:33,916 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:39:35,371 WARN L205 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 347 DAG size of output: 270 [2021-03-26 00:39:35,923 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:39:35,933 INFO L154 LiptonReduction]: Checked pairs total: 75 [2021-03-26 00:39:35,933 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:39:35,933 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3429 [2021-03-26 00:39:35,934 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 463 flow [2021-03-26 00:39:35,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:35,934 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:35,934 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:35,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:39:35,934 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:35,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:35,935 INFO L82 PathProgramCache]: Analyzing trace with hash -460161281, now seen corresponding path program 1 times [2021-03-26 00:39:35,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:35,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844716344] [2021-03-26 00:39:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:39:36,011 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:39:36,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:39:36,039 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:39:36,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 00:39:36,076 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-26 00:39:36,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 00:39:36,124 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-26 00:39:36,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 00:39:36,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:36,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:39:36,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:39:36,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 00:39:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:39:36,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844716344] [2021-03-26 00:39:36,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:39:36,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:39:36,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530317054] [2021-03-26 00:39:36,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:39:36,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:39:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:39:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:39:36,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 173 [2021-03-26 00:39:36,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 463 flow. Second operand has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:36,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:39:36,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 173 [2021-03-26 00:39:36,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:39:36,392 INFO L129 PetriNetUnfolder]: 97/286 cut-off events. [2021-03-26 00:39:36,392 INFO L130 PetriNetUnfolder]: For 2764/3023 co-relation queries the response was YES. [2021-03-26 00:39:36,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 286 events. 97/286 cut-off events. For 2764/3023 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1685 event pairs, 0 based on Foata normal form. 63/342 useless extension candidates. Maximal degree in co-relation 1293. Up to 78 conditions per place. [2021-03-26 00:39:36,395 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 20 selfloop transitions, 12 changer transitions 4/58 dead transitions. [2021-03-26 00:39:36,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 58 transitions, 530 flow [2021-03-26 00:39:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:39:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:39:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2021-03-26 00:39:36,397 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.733140655105973 [2021-03-26 00:39:36,398 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 761 transitions. [2021-03-26 00:39:36,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 761 transitions. [2021-03-26 00:39:36,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:39:36,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 761 transitions. [2021-03-26 00:39:36,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:36,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:36,401 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:36,402 INFO L185 Difference]: Start difference. First operand has 73 places, 59 transitions, 463 flow. Second operand 6 states and 761 transitions. [2021-03-26 00:39:36,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 58 transitions, 530 flow [2021-03-26 00:39:36,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 480 flow, removed 16 selfloop flow, removed 10 redundant places. [2021-03-26 00:39:36,408 INFO L241 Difference]: Finished difference. Result has 62 places, 50 transitions, 361 flow [2021-03-26 00:39:36,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2021-03-26 00:39:36,408 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2021-03-26 00:39:36,409 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:39:36,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 50 transitions, 361 flow [2021-03-26 00:39:36,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 50 transitions, 361 flow [2021-03-26 00:39:36,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 361 flow [2021-03-26 00:39:36,434 INFO L129 PetriNetUnfolder]: 77/232 cut-off events. [2021-03-26 00:39:36,435 INFO L130 PetriNetUnfolder]: For 673/719 co-relation queries the response was YES. [2021-03-26 00:39:36,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 232 events. 77/232 cut-off events. For 673/719 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1315 event pairs, 1 based on Foata normal form. 11/238 useless extension candidates. Maximal degree in co-relation 869. Up to 68 conditions per place. [2021-03-26 00:39:36,437 INFO L142 LiptonReduction]: Number of co-enabled transitions 348 [2021-03-26 00:39:36,441 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:39:36,442 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:39:36,442 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 00:39:36,442 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 361 flow [2021-03-26 00:39:36,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:39:36,443 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:39:36,443 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:39:36,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:39:36,443 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:39:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:39:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1062176914, now seen corresponding path program 1 times [2021-03-26 00:39:36,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:39:36,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486773713] [2021-03-26 00:39:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:39:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:39:36,494 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:39:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:39:36,565 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:39:36,610 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:39:36,611 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:39:36,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:39:36,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:39:36 BasicIcfg [2021-03-26 00:39:36,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:39:36,705 INFO L168 Benchmark]: Toolchain (without parser) took 23029.39 ms. Allocated memory was 255.9 MB in the beginning and 660.6 MB in the end (delta: 404.8 MB). Free memory was 234.6 MB in the beginning and 612.7 MB in the end (delta: -378.1 MB). Peak memory consumption was 390.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:36,705 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:39:36,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.87 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.0 MB in the beginning and 301.7 MB in the end (delta: -67.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:36,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.80 ms. Allocated memory is still 341.8 MB. Free memory was 301.7 MB in the beginning and 298.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:36,708 INFO L168 Benchmark]: Boogie Preprocessor took 47.59 ms. Allocated memory is still 341.8 MB. Free memory was 298.9 MB in the beginning and 296.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:36,708 INFO L168 Benchmark]: RCFGBuilder took 2004.19 ms. Allocated memory is still 341.8 MB. Free memory was 296.1 MB in the beginning and 196.5 MB in the end (delta: 99.6 MB). Peak memory consumption was 103.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:36,711 INFO L168 Benchmark]: TraceAbstraction took 20384.91 ms. Allocated memory was 341.8 MB in the beginning and 660.6 MB in the end (delta: 318.8 MB). Free memory was 195.4 MB in the beginning and 612.7 MB in the end (delta: -417.2 MB). Peak memory consumption was 265.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:39:36,714 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.21 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 526.87 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.0 MB in the beginning and 301.7 MB in the end (delta: -67.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.80 ms. Allocated memory is still 341.8 MB. Free memory was 301.7 MB in the beginning and 298.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.59 ms. Allocated memory is still 341.8 MB. Free memory was 298.9 MB in the beginning and 296.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2004.19 ms. Allocated memory is still 341.8 MB. Free memory was 296.1 MB in the beginning and 196.5 MB in the end (delta: 99.6 MB). Peak memory consumption was 103.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20384.91 ms. Allocated memory was 341.8 MB in the beginning and 660.6 MB in the end (delta: 318.8 MB). Free memory was 195.4 MB in the beginning and 612.7 MB in the end (delta: -417.2 MB). Peak memory consumption was 265.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8033.9ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3065 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, positive: 1462, positive conditional: 1462, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1157, positive: 1122, positive conditional: 0, positive unconditional: 1122, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1157, positive: 1122, positive conditional: 0, positive unconditional: 1122, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1157, positive: 1116, positive conditional: 0, positive unconditional: 1116, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 425, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 407, negative conditional: 0, negative unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1546, positive: 340, positive conditional: 340, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 1157, unknown conditional: 1157, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3034.5ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 179, positive conditional: 179, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 2, positive unconditional: 31, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 2, positive unconditional: 31, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 232, negative conditional: 20, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 146, positive conditional: 146, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 79, Positive conditional cache size: 79, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1126.4ms, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 14, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 14, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 183, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 94, Positive conditional cache size: 94, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 258 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 107, Positive conditional cache size: 107, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 17, positive conditional: 7, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 17, positive conditional: 7, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 124, Positive conditional cache size: 124, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.1ms, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 6, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 6, positive unconditional: 4, 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: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 134, Positive conditional cache size: 134, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.9ms, 49 PlacesBefore, 49 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, 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: 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: 20, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.7ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 86 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 109.1ms, 58 PlacesBefore, 58 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 251 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 28, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 28, positive unconditional: 4, 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: 33, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 171, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.0ms, 62 PlacesBefore, 62 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 171, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.4ms, 70 PlacesBefore, 70 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 171, Positive conditional cache size: 171, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3428.4ms, 76 PlacesBefore, 73 PlacesAfterwards, 64 TransitionsBefore, 59 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, positive: 75, positive conditional: 75, 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: 75, positive: 75, positive conditional: 0, positive unconditional: 75, 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: 75, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 75, unknown conditional: 75, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 117, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.7ms, 62 PlacesBefore, 62 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 117, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2037; [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2038; [L821] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L822] 0 pthread_t t2039; [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20161.3ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1711.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8138.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 50 SDtfs, 28 SDslu, 17 SDs, 0 SdLazy, 322 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 432.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 667.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=518occurred in iteration=11, InterpolantAutomatonStates: 63, 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: 38.5ms SsaConstructionTime, 423.2ms SatisfiabilityAnalysisTime, 1202.9ms InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...