/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:48:09,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:48:09,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:48:09,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:48:09,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:48:09,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:48:09,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:48:09,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:48:09,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:48:09,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:48:09,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:48:09,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:48:09,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:48:09,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:48:09,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:48:09,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:48:09,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:48:09,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:48:09,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:48:09,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:48:09,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:48:09,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:48:09,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:48:09,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:48:09,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:48:09,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:48:09,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:48:09,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:48:09,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:48:09,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:48:09,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:48:09,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:48:09,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:48:09,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:48:09,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:48:09,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:48:09,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:48:09,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:48:09,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:48:09,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:48:09,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:48:09,133 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:48:09,155 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:48:09,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:48:09,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:48:09,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:48:09,157 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:48:09,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:48:09,157 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:48:09,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:48:09,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:48:09,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:48:09,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:48:09,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:48:09,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:48:09,159 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:48:09,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:48:09,159 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:48:09,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:48:09,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:48:09,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:48:09,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:48:09,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:48:09,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:48:09,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:48:09,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:48:09,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:48:09,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:48:09,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:48:09,161 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:48:09,162 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:48:09,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:48:09,162 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:48:09,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:48:09,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:48:09,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:48:09,455 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:48:09,457 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:48:09,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-03-26 00:48:09,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8b9e36d/ed442c65aaac4e9398e0a9362d30d551/FLAG9887256a1 [2021-03-26 00:48:10,055 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:48:10,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-03-26 00:48:10,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8b9e36d/ed442c65aaac4e9398e0a9362d30d551/FLAG9887256a1 [2021-03-26 00:48:10,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8b9e36d/ed442c65aaac4e9398e0a9362d30d551 [2021-03-26 00:48:10,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:48:10,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:48:10,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:48:10,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:48:10,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:48:10,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463002f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10, skipping insertion in model container [2021-03-26 00:48:10,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:48:10,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:48:10,559 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/safe029_power.opt.i[951,964] [2021-03-26 00:48:10,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:48:10,787 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:48:10,798 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/safe029_power.opt.i[951,964] [2021-03-26 00:48:10,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:48:10,907 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:48:10,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10 WrapperNode [2021-03-26 00:48:10,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:48:10,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:48:10,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:48:10,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:48:10,914 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:48:10" (1/1) ... [2021-03-26 00:48:10,927 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:48:10" (1/1) ... [2021-03-26 00:48:10,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:48:10,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:48:10,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:48:10,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:48:10,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (1/1) ... [2021-03-26 00:48:10,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:48:10,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:48:10,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:48:10,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:48:10,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (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:48:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:48:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:48:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:48:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:48:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:48:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:48:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:48:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:48:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:48:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:48:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:48:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:48:11,053 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:48:12,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:48:12,504 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:48:12,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:48:12 BoogieIcfgContainer [2021-03-26 00:48:12,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:48:12,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:48:12,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:48:12,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:48:12,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:48:10" (1/3) ... [2021-03-26 00:48:12,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:48:12, skipping insertion in model container [2021-03-26 00:48:12,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:10" (2/3) ... [2021-03-26 00:48:12,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:48:12, skipping insertion in model container [2021-03-26 00:48:12,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:48:12" (3/3) ... [2021-03-26 00:48:12,514 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2021-03-26 00:48:12,520 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:48:12,548 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:48:12,549 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:48:12,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,587 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:12,599 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:48:12,614 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:48:12,640 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:48:12,640 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:48:12,640 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:48:12,640 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:48:12,640 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:48:12,640 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:48:12,641 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:48:12,641 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:48:12,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 00:48:12,675 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 00:48:12,675 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:12,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 00:48:12,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 00:48:12,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:12,682 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:12,692 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:12,694 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:12,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:12,708 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 00:48:12,709 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:12,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 00:48:12,711 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 00:48:13,976 WARN L205 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 00:48:14,301 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 00:48:15,659 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 00:48:16,262 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 00:48:16,879 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:48:17,236 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:48:17,364 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:48:18,599 WARN L205 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 00:48:18,884 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 00:48:19,449 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:20,026 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:20,305 INFO L154 LiptonReduction]: Checked pairs total: 1657 [2021-03-26 00:48:20,305 INFO L156 LiptonReduction]: Total number of compositions: 53 [2021-03-26 00:48:20,307 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7625 [2021-03-26 00:48:20,317 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:48:20,317 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:20,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:20,318 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:20,318 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:20,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1463710772, now seen corresponding path program 1 times [2021-03-26 00:48:20,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:20,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948843282] [2021-03-26 00:48:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:20,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:20,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:20,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:20,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:20,518 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:48:20,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948843282] [2021-03-26 00:48:20,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:20,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:20,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869720005] [2021-03-26 00:48:20,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:20,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:20,534 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2021-03-26 00:48:20,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:48:20,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:20,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2021-03-26 00:48:20,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:20,588 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 00:48:20,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:20,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 332 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 130. Up to 37 conditions per place. [2021-03-26 00:48:20,590 INFO L132 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-03-26 00:48:20,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 92 flow [2021-03-26 00:48:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2021-03-26 00:48:20,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2021-03-26 00:48:20,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2021-03-26 00:48:20,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2021-03-26 00:48:20,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:20,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2021-03-26 00:48:20,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:48:20,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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:48:20,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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:48:20,614 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 347 transitions. [2021-03-26 00:48:20,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 92 flow [2021-03-26 00:48:20,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:20,618 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2021-03-26 00:48:20,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 00:48:20,620 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-26 00:48:20,620 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:20,620 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-26 00:48:20,620 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-26 00:48:20,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2021-03-26 00:48:20,624 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 00:48:20,625 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:20,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:48:20,625 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 00:48:20,988 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:48:21,321 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:48:22,509 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-03-26 00:48:23,127 WARN L205 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:23,682 INFO L154 LiptonReduction]: Checked pairs total: 448 [2021-03-26 00:48:23,682 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:48:23,683 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3063 [2021-03-26 00:48:23,684 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 00:48:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:48:23,685 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:23,685 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:23,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:48:23,685 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1396965882, now seen corresponding path program 1 times [2021-03-26 00:48:23,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:23,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603671387] [2021-03-26 00:48:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:23,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:23,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:23,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:23,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:23,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:23,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:23,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:23,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:23,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603671387] [2021-03-26 00:48:23,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:23,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:48:23,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204721181] [2021-03-26 00:48:23,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:48:23,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:23,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:48:23,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:48:23,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 138 [2021-03-26 00:48:23,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 8 states, 8 states have (on average 97.875) internal successors, (783), 8 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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:48:23,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:23,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 138 [2021-03-26 00:48:23,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:24,031 INFO L129 PetriNetUnfolder]: 28/76 cut-off events. [2021-03-26 00:48:24,032 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 00:48:24,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 76 events. 28/76 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 254 event pairs, 16 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 136. Up to 52 conditions per place. [2021-03-26 00:48:24,033 INFO L132 encePairwiseOnDemand]: 131/138 looper letters, 7 selfloop transitions, 8 changer transitions 0/25 dead transitions. [2021-03-26 00:48:24,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 90 flow [2021-03-26 00:48:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2021-03-26 00:48:24,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7260869565217392 [2021-03-26 00:48:24,037 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2021-03-26 00:48:24,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2021-03-26 00:48:24,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:24,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2021-03-26 00:48:24,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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:48:24,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:48:24,041 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:48:24,042 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 501 transitions. [2021-03-26 00:48:24,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 90 flow [2021-03-26 00:48:24,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:24,043 INFO L241 Difference]: Finished difference. Result has 29 places, 24 transitions, 88 flow [2021-03-26 00:48:24,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2021-03-26 00:48:24,043 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2021-03-26 00:48:24,043 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:24,044 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 88 flow [2021-03-26 00:48:24,044 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 88 flow [2021-03-26 00:48:24,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 88 flow [2021-03-26 00:48:24,052 INFO L129 PetriNetUnfolder]: 14/51 cut-off events. [2021-03-26 00:48:24,052 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 00:48:24,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 51 events. 14/51 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 4 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 94. Up to 22 conditions per place. [2021-03-26 00:48:24,053 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 00:48:24,410 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:48:24,716 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 00:48:24,822 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 00:48:25,058 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 00:48:25,174 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 00:48:25,178 INFO L154 LiptonReduction]: Checked pairs total: 264 [2021-03-26 00:48:25,178 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:48:25,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1135 [2021-03-26 00:48:25,179 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2021-03-26 00:48:25,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 97.875) internal successors, (783), 8 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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:48:25,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:25,180 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:25,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:48:25,180 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1388590944, now seen corresponding path program 1 times [2021-03-26 00:48:25,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:25,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006588281] [2021-03-26 00:48:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:25,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:25,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:25,232 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:48:25,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006588281] [2021-03-26 00:48:25,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:25,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:25,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372627473] [2021-03-26 00:48:25,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:25,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:25,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2021-03-26 00:48:25,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:48:25,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:25,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2021-03-26 00:48:25,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:25,255 INFO L129 PetriNetUnfolder]: 23/69 cut-off events. [2021-03-26 00:48:25,255 INFO L130 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2021-03-26 00:48:25,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 69 events. 23/69 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 230 event pairs, 7 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 158. Up to 34 conditions per place. [2021-03-26 00:48:25,256 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 4 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 00:48:25,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 100 flow [2021-03-26 00:48:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2021-03-26 00:48:25,259 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2021-03-26 00:48:25,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2021-03-26 00:48:25,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2021-03-26 00:48:25,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:25,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2021-03-26 00:48:25,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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:48:25,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:48:25,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:48:25,262 INFO L185 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 3 states and 367 transitions. [2021-03-26 00:48:25,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 100 flow [2021-03-26 00:48:25,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:48:25,264 INFO L241 Difference]: Finished difference. Result has 29 places, 24 transitions, 103 flow [2021-03-26 00:48:25,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2021-03-26 00:48:25,264 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2021-03-26 00:48:25,264 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:25,264 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 103 flow [2021-03-26 00:48:25,265 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 103 flow [2021-03-26 00:48:25,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 103 flow [2021-03-26 00:48:25,276 INFO L129 PetriNetUnfolder]: 27/71 cut-off events. [2021-03-26 00:48:25,276 INFO L130 PetriNetUnfolder]: For 31/33 co-relation queries the response was YES. [2021-03-26 00:48:25,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 71 events. 27/71 cut-off events. For 31/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 230 event pairs, 7 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 167. Up to 34 conditions per place. [2021-03-26 00:48:25,277 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 00:48:25,279 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-26 00:48:25,279 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:25,279 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 00:48:25,280 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 103 flow [2021-03-26 00:48:25,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:48:25,281 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:25,281 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:25,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:48:25,281 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1125635390, now seen corresponding path program 1 times [2021-03-26 00:48:25,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:25,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946145279] [2021-03-26 00:48:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:25,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:48:25,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:25,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:25,393 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:48:25,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946145279] [2021-03-26 00:48:25,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:25,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:25,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167231860] [2021-03-26 00:48:25,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:25,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:25,396 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2021-03-26 00:48:25,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:48:25,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:25,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2021-03-26 00:48:25,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:25,442 INFO L129 PetriNetUnfolder]: 33/90 cut-off events. [2021-03-26 00:48:25,442 INFO L130 PetriNetUnfolder]: For 80/83 co-relation queries the response was YES. [2021-03-26 00:48:25,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 90 events. 33/90 cut-off events. For 80/83 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 318 event pairs, 19 based on Foata normal form. 7/92 useless extension candidates. Maximal degree in co-relation 242. Up to 55 conditions per place. [2021-03-26 00:48:25,445 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 8 selfloop transitions, 7 changer transitions 0/26 dead transitions. [2021-03-26 00:48:25,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 138 flow [2021-03-26 00:48:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:48:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:48:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2021-03-26 00:48:25,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7607142857142857 [2021-03-26 00:48:25,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2021-03-26 00:48:25,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2021-03-26 00:48:25,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:25,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2021-03-26 00:48:25,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:48:25,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:25,451 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:25,451 INFO L185 Difference]: Start difference. First operand has 29 places, 24 transitions, 103 flow. Second operand 4 states and 426 transitions. [2021-03-26 00:48:25,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 138 flow [2021-03-26 00:48:25,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:25,453 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 126 flow [2021-03-26 00:48:25,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-26 00:48:25,453 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2021-03-26 00:48:25,453 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:25,453 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 126 flow [2021-03-26 00:48:25,453 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 126 flow [2021-03-26 00:48:25,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 126 flow [2021-03-26 00:48:25,461 INFO L129 PetriNetUnfolder]: 19/59 cut-off events. [2021-03-26 00:48:25,461 INFO L130 PetriNetUnfolder]: For 62/66 co-relation queries the response was YES. [2021-03-26 00:48:25,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 59 events. 19/59 cut-off events. For 62/66 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 196 event pairs, 6 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 164. Up to 25 conditions per place. [2021-03-26 00:48:25,462 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 00:48:25,519 INFO L154 LiptonReduction]: Checked pairs total: 82 [2021-03-26 00:48:25,519 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:25,519 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-26 00:48:25,520 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 126 flow [2021-03-26 00:48:25,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:48:25,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:25,521 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:25,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:48:25,521 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1850481260, now seen corresponding path program 1 times [2021-03-26 00:48:25,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:25,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790968803] [2021-03-26 00:48:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:25,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:48:25,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:25,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:48:25,585 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-03-26 00:48:25,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:25,594 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:48:25,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790968803] [2021-03-26 00:48:25,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:25,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:25,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500693943] [2021-03-26 00:48:25,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:25,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:25,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:25,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2021-03-26 00:48:25,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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:48:25,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:25,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2021-03-26 00:48:25,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:25,748 INFO L129 PetriNetUnfolder]: 117/223 cut-off events. [2021-03-26 00:48:25,748 INFO L130 PetriNetUnfolder]: For 311/313 co-relation queries the response was YES. [2021-03-26 00:48:25,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 223 events. 117/223 cut-off events. For 311/313 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 865 event pairs, 38 based on Foata normal form. 4/207 useless extension candidates. Maximal degree in co-relation 669. Up to 173 conditions per place. [2021-03-26 00:48:25,751 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 20 selfloop transitions, 9 changer transitions 3/39 dead transitions. [2021-03-26 00:48:25,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 228 flow [2021-03-26 00:48:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2021-03-26 00:48:25,753 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7271428571428571 [2021-03-26 00:48:25,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2021-03-26 00:48:25,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2021-03-26 00:48:25,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:25,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2021-03-26 00:48:25,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:25,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:25,757 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:25,758 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 126 flow. Second operand 5 states and 509 transitions. [2021-03-26 00:48:25,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 228 flow [2021-03-26 00:48:25,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:25,762 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 176 flow [2021-03-26 00:48:25,762 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2021-03-26 00:48:25,762 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2021-03-26 00:48:25,762 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:25,762 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 176 flow [2021-03-26 00:48:25,763 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 176 flow [2021-03-26 00:48:25,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 176 flow [2021-03-26 00:48:25,784 INFO L129 PetriNetUnfolder]: 37/93 cut-off events. [2021-03-26 00:48:25,784 INFO L130 PetriNetUnfolder]: For 235/238 co-relation queries the response was YES. [2021-03-26 00:48:25,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 93 events. 37/93 cut-off events. For 235/238 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 330 event pairs, 15 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 306. Up to 35 conditions per place. [2021-03-26 00:48:25,785 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 00:48:25,795 INFO L154 LiptonReduction]: Checked pairs total: 44 [2021-03-26 00:48:25,795 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:25,795 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 00:48:25,798 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 176 flow [2021-03-26 00:48:25,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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:48:25,798 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:25,798 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:25,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:48:25,799 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1517208378, now seen corresponding path program 1 times [2021-03-26 00:48:25,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:25,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146139989] [2021-03-26 00:48:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:25,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:25,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:25,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:25,922 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:48:25,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:48:25,941 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:48:25,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146139989] [2021-03-26 00:48:25,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:25,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:25,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486089879] [2021-03-26 00:48:25,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:25,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:25,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 140 [2021-03-26 00:48:25,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:48:25,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:25,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 140 [2021-03-26 00:48:25,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:26,018 INFO L129 PetriNetUnfolder]: 40/102 cut-off events. [2021-03-26 00:48:26,019 INFO L130 PetriNetUnfolder]: For 343/349 co-relation queries the response was YES. [2021-03-26 00:48:26,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 102 events. 40/102 cut-off events. For 343/349 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 382 event pairs, 8 based on Foata normal form. 5/103 useless extension candidates. Maximal degree in co-relation 391. Up to 55 conditions per place. [2021-03-26 00:48:26,020 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 13 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2021-03-26 00:48:26,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 248 flow [2021-03-26 00:48:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2021-03-26 00:48:26,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7457142857142857 [2021-03-26 00:48:26,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2021-03-26 00:48:26,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2021-03-26 00:48:26,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:26,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2021-03-26 00:48:26,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:48:26,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,031 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,031 INFO L185 Difference]: Start difference. First operand has 37 places, 30 transitions, 176 flow. Second operand 5 states and 522 transitions. [2021-03-26 00:48:26,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 248 flow [2021-03-26 00:48:26,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 237 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:26,036 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 204 flow [2021-03-26 00:48:26,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-03-26 00:48:26,036 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2021-03-26 00:48:26,037 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:26,037 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 204 flow [2021-03-26 00:48:26,037 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 204 flow [2021-03-26 00:48:26,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 204 flow [2021-03-26 00:48:26,052 INFO L129 PetriNetUnfolder]: 41/99 cut-off events. [2021-03-26 00:48:26,052 INFO L130 PetriNetUnfolder]: For 386/392 co-relation queries the response was YES. [2021-03-26 00:48:26,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 99 events. 41/99 cut-off events. For 386/392 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 14 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 369. Up to 39 conditions per place. [2021-03-26 00:48:26,054 INFO L142 LiptonReduction]: Number of co-enabled transitions 152 [2021-03-26 00:48:26,225 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:48:26,611 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 00:48:26,749 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:48:26,753 INFO L154 LiptonReduction]: Checked pairs total: 114 [2021-03-26 00:48:26,753 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:26,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 717 [2021-03-26 00:48:26,754 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 207 flow [2021-03-26 00:48:26,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:48:26,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:26,755 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:26,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:48:26,755 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1530344188, now seen corresponding path program 2 times [2021-03-26 00:48:26,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:26,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109084764] [2021-03-26 00:48:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:26,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:26,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:26,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:26,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:48:26,829 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:48:26,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109084764] [2021-03-26 00:48:26,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:26,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:26,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117767804] [2021-03-26 00:48:26,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:26,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:26,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 141 [2021-03-26 00:48:26,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states 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:48:26,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:26,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 141 [2021-03-26 00:48:26,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:26,907 INFO L129 PetriNetUnfolder]: 41/108 cut-off events. [2021-03-26 00:48:26,907 INFO L130 PetriNetUnfolder]: For 522/532 co-relation queries the response was YES. [2021-03-26 00:48:26,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 108 events. 41/108 cut-off events. For 522/532 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 449 event pairs, 5 based on Foata normal form. 8/106 useless extension candidates. Maximal degree in co-relation 461. Up to 54 conditions per place. [2021-03-26 00:48:26,909 INFO L132 encePairwiseOnDemand]: 134/141 looper letters, 13 selfloop transitions, 14 changer transitions 0/39 dead transitions. [2021-03-26 00:48:26,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 309 flow [2021-03-26 00:48:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2021-03-26 00:48:26,912 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7702127659574468 [2021-03-26 00:48:26,912 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2021-03-26 00:48:26,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2021-03-26 00:48:26,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:26,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2021-03-26 00:48:26,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:48:26,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,915 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,915 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 207 flow. Second operand 5 states and 543 transitions. [2021-03-26 00:48:26,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 309 flow [2021-03-26 00:48:26,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 282 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:26,918 INFO L241 Difference]: Finished difference. Result has 43 places, 37 transitions, 267 flow [2021-03-26 00:48:26,918 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2021-03-26 00:48:26,918 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-26 00:48:26,918 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:26,918 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 267 flow [2021-03-26 00:48:26,919 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 267 flow [2021-03-26 00:48:26,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 267 flow [2021-03-26 00:48:26,934 INFO L129 PetriNetUnfolder]: 48/116 cut-off events. [2021-03-26 00:48:26,934 INFO L130 PetriNetUnfolder]: For 448/457 co-relation queries the response was YES. [2021-03-26 00:48:26,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 116 events. 48/116 cut-off events. For 448/457 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 469 event pairs, 7 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 483. Up to 58 conditions per place. [2021-03-26 00:48:26,936 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 00:48:26,939 INFO L154 LiptonReduction]: Checked pairs total: 68 [2021-03-26 00:48:26,939 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:26,939 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 00:48:26,940 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 267 flow [2021-03-26 00:48:26,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states 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:48:26,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:26,940 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:26,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:48:26,940 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2036150850, now seen corresponding path program 1 times [2021-03-26 00:48:26,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:26,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123994055] [2021-03-26 00:48:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:27,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:27,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:27,036 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 00:48:27,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:48:27,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:27,062 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:48:27,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123994055] [2021-03-26 00:48:27,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:27,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:27,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422243393] [2021-03-26 00:48:27,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:27,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:27,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:27,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:27,064 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 141 [2021-03-26 00:48:27,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:48:27,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:27,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 141 [2021-03-26 00:48:27,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:27,149 INFO L129 PetriNetUnfolder]: 44/120 cut-off events. [2021-03-26 00:48:27,149 INFO L130 PetriNetUnfolder]: For 536/547 co-relation queries the response was YES. [2021-03-26 00:48:27,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 120 events. 44/120 cut-off events. For 536/547 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 522 event pairs, 5 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 557. Up to 63 conditions per place. [2021-03-26 00:48:27,150 INFO L132 encePairwiseOnDemand]: 133/141 looper letters, 16 selfloop transitions, 17 changer transitions 0/45 dead transitions. [2021-03-26 00:48:27,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 403 flow [2021-03-26 00:48:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2021-03-26 00:48:27,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7049645390070922 [2021-03-26 00:48:27,153 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2021-03-26 00:48:27,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2021-03-26 00:48:27,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:27,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2021-03-26 00:48:27,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:48:27,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:27,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:27,157 INFO L185 Difference]: Start difference. First operand has 43 places, 37 transitions, 267 flow. Second operand 5 states and 497 transitions. [2021-03-26 00:48:27,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 403 flow [2021-03-26 00:48:27,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 374 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:27,162 INFO L241 Difference]: Finished difference. Result has 46 places, 42 transitions, 344 flow [2021-03-26 00:48:27,162 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2021-03-26 00:48:27,162 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2021-03-26 00:48:27,162 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:27,163 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 344 flow [2021-03-26 00:48:27,163 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 344 flow [2021-03-26 00:48:27,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 344 flow [2021-03-26 00:48:27,181 INFO L129 PetriNetUnfolder]: 46/121 cut-off events. [2021-03-26 00:48:27,181 INFO L130 PetriNetUnfolder]: For 514/525 co-relation queries the response was YES. [2021-03-26 00:48:27,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 121 events. 46/121 cut-off events. For 514/525 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 528 event pairs, 9 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 518. Up to 56 conditions per place. [2021-03-26 00:48:27,183 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-26 00:48:27,187 INFO L154 LiptonReduction]: Checked pairs total: 86 [2021-03-26 00:48:27,187 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:27,187 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 00:48:27,188 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 344 flow [2021-03-26 00:48:27,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:48:27,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:27,188 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:27,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:48:27,189 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash -538246668, now seen corresponding path program 3 times [2021-03-26 00:48:27,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:27,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80420526] [2021-03-26 00:48:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:27,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:27,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:27,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:27,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:27,266 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:48:27,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80420526] [2021-03-26 00:48:27,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:27,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:27,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379793034] [2021-03-26 00:48:27,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:27,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:27,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 141 [2021-03-26 00:48:27,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states 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:48:27,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:27,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 141 [2021-03-26 00:48:27,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:27,324 INFO L129 PetriNetUnfolder]: 42/119 cut-off events. [2021-03-26 00:48:27,324 INFO L130 PetriNetUnfolder]: For 700/736 co-relation queries the response was YES. [2021-03-26 00:48:27,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 119 events. 42/119 cut-off events. For 700/736 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 517 event pairs, 7 based on Foata normal form. 13/127 useless extension candidates. Maximal degree in co-relation 583. Up to 64 conditions per place. [2021-03-26 00:48:27,325 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 23 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2021-03-26 00:48:27,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 474 flow [2021-03-26 00:48:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:48:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:48:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2021-03-26 00:48:27,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7960992907801419 [2021-03-26 00:48:27,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2021-03-26 00:48:27,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2021-03-26 00:48:27,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:27,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2021-03-26 00:48:27,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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:48:27,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:48:27,330 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:48:27,330 INFO L185 Difference]: Start difference. First operand has 46 places, 42 transitions, 344 flow. Second operand 4 states and 449 transitions. [2021-03-26 00:48:27,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 474 flow [2021-03-26 00:48:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 451 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:27,334 INFO L241 Difference]: Finished difference. Result has 49 places, 45 transitions, 400 flow [2021-03-26 00:48:27,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=400, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2021-03-26 00:48:27,334 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2021-03-26 00:48:27,334 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:27,334 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 400 flow [2021-03-26 00:48:27,335 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 400 flow [2021-03-26 00:48:27,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 400 flow [2021-03-26 00:48:27,352 INFO L129 PetriNetUnfolder]: 46/122 cut-off events. [2021-03-26 00:48:27,353 INFO L130 PetriNetUnfolder]: For 670/681 co-relation queries the response was YES. [2021-03-26 00:48:27,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 122 events. 46/122 cut-off events. For 670/681 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 543 event pairs, 9 based on Foata normal form. 4/121 useless extension candidates. Maximal degree in co-relation 574. Up to 57 conditions per place. [2021-03-26 00:48:27,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 178 [2021-03-26 00:48:27,364 INFO L154 LiptonReduction]: Checked pairs total: 175 [2021-03-26 00:48:27,364 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:27,364 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 00:48:27,366 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 391 flow [2021-03-26 00:48:27,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states 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:48:27,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:27,366 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:27,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:48:27,366 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1230910203, now seen corresponding path program 1 times [2021-03-26 00:48:27,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:27,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552642016] [2021-03-26 00:48:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:27,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:27,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:27,404 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:48:27,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552642016] [2021-03-26 00:48:27,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:27,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:27,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446320266] [2021-03-26 00:48:27,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:27,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:27,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:27,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:27,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 141 [2021-03-26 00:48:27,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:48:27,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:27,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 141 [2021-03-26 00:48:27,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:27,455 INFO L129 PetriNetUnfolder]: 44/144 cut-off events. [2021-03-26 00:48:27,455 INFO L130 PetriNetUnfolder]: For 1064/1090 co-relation queries the response was YES. [2021-03-26 00:48:27,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 144 events. 44/144 cut-off events. For 1064/1090 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 695 event pairs, 11 based on Foata normal form. 14/155 useless extension candidates. Maximal degree in co-relation 662. Up to 68 conditions per place. [2021-03-26 00:48:27,456 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 3 selfloop transitions, 3 changer transitions 12/44 dead transitions. [2021-03-26 00:48:27,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 403 flow [2021-03-26 00:48:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-03-26 00:48:27,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2021-03-26 00:48:27,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-03-26 00:48:27,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-03-26 00:48:27,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:27,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-03-26 00:48:27,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:48:27,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:48:27,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:48:27,462 INFO L185 Difference]: Start difference. First operand has 49 places, 44 transitions, 391 flow. Second operand 3 states and 369 transitions. [2021-03-26 00:48:27,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 403 flow [2021-03-26 00:48:27,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 385 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:27,466 INFO L241 Difference]: Finished difference. Result has 50 places, 32 transitions, 267 flow [2021-03-26 00:48:27,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2021-03-26 00:48:27,467 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2021-03-26 00:48:27,467 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:27,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 32 transitions, 267 flow [2021-03-26 00:48:27,467 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 32 transitions, 267 flow [2021-03-26 00:48:27,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 267 flow [2021-03-26 00:48:27,481 INFO L129 PetriNetUnfolder]: 34/116 cut-off events. [2021-03-26 00:48:27,482 INFO L130 PetriNetUnfolder]: For 579/586 co-relation queries the response was YES. [2021-03-26 00:48:27,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 116 events. 34/116 cut-off events. For 579/586 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 521 event pairs, 13 based on Foata normal form. 5/117 useless extension candidates. Maximal degree in co-relation 518. Up to 59 conditions per place. [2021-03-26 00:48:27,483 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-26 00:48:27,487 INFO L154 LiptonReduction]: Checked pairs total: 60 [2021-03-26 00:48:27,487 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:27,487 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 00:48:27,488 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 267 flow [2021-03-26 00:48:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:48:27,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:27,488 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:27,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:48:27,488 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash 594895541, now seen corresponding path program 1 times [2021-03-26 00:48:27,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:27,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955683886] [2021-03-26 00:48:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:27,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:27,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:27,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:27,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:48:27,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:27,608 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:48:27,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955683886] [2021-03-26 00:48:27,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:27,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:27,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125508093] [2021-03-26 00:48:27,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:27,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:27,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 141 [2021-03-26 00:48:27,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:48:27,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:27,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 141 [2021-03-26 00:48:27,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:27,709 INFO L129 PetriNetUnfolder]: 37/123 cut-off events. [2021-03-26 00:48:27,709 INFO L130 PetriNetUnfolder]: For 800/822 co-relation queries the response was YES. [2021-03-26 00:48:27,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 123 events. 37/123 cut-off events. For 800/822 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 553 event pairs, 5 based on Foata normal form. 11/131 useless extension candidates. Maximal degree in co-relation 633. Up to 64 conditions per place. [2021-03-26 00:48:27,710 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 11 selfloop transitions, 8 changer transitions 7/37 dead transitions. [2021-03-26 00:48:27,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 37 transitions, 369 flow [2021-03-26 00:48:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:48:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:48:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2021-03-26 00:48:27,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7434988179669031 [2021-03-26 00:48:27,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2021-03-26 00:48:27,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2021-03-26 00:48:27,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:27,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2021-03-26 00:48:27,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states 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:48:27,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:48:27,717 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:48:27,717 INFO L185 Difference]: Start difference. First operand has 49 places, 32 transitions, 267 flow. Second operand 6 states and 629 transitions. [2021-03-26 00:48:27,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 37 transitions, 369 flow [2021-03-26 00:48:27,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 319 flow, removed 14 selfloop flow, removed 9 redundant places. [2021-03-26 00:48:27,720 INFO L241 Difference]: Finished difference. Result has 46 places, 29 transitions, 231 flow [2021-03-26 00:48:27,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2021-03-26 00:48:27,720 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2021-03-26 00:48:27,720 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:27,720 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 29 transitions, 231 flow [2021-03-26 00:48:27,720 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 29 transitions, 231 flow [2021-03-26 00:48:27,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 231 flow [2021-03-26 00:48:27,734 INFO L129 PetriNetUnfolder]: 31/106 cut-off events. [2021-03-26 00:48:27,734 INFO L130 PetriNetUnfolder]: For 413/418 co-relation queries the response was YES. [2021-03-26 00:48:27,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 106 events. 31/106 cut-off events. For 413/418 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 457 event pairs, 11 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 461. Up to 55 conditions per place. [2021-03-26 00:48:27,735 INFO L142 LiptonReduction]: Number of co-enabled transitions 116 [2021-03-26 00:48:27,738 INFO L154 LiptonReduction]: Checked pairs total: 57 [2021-03-26 00:48:27,738 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:27,739 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 00:48:27,739 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 231 flow [2021-03-26 00:48:27,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:48:27,740 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:27,740 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:27,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:48:27,740 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash 605043701, now seen corresponding path program 2 times [2021-03-26 00:48:27,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:27,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752957134] [2021-03-26 00:48:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:27,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:27,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:27,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:27,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:48:27,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:27,828 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:48:27,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752957134] [2021-03-26 00:48:27,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:27,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:27,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37936998] [2021-03-26 00:48:27,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:27,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:27,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:27,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:27,832 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 141 [2021-03-26 00:48:27,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:48:27,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:27,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 141 [2021-03-26 00:48:27,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:27,935 INFO L129 PetriNetUnfolder]: 26/100 cut-off events. [2021-03-26 00:48:27,935 INFO L130 PetriNetUnfolder]: For 610/643 co-relation queries the response was YES. [2021-03-26 00:48:27,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 100 events. 26/100 cut-off events. For 610/643 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 448 event pairs, 1 based on Foata normal form. 24/121 useless extension candidates. Maximal degree in co-relation 475. Up to 51 conditions per place. [2021-03-26 00:48:27,936 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 7 selfloop transitions, 13 changer transitions 3/32 dead transitions. [2021-03-26 00:48:27,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 32 transitions, 297 flow [2021-03-26 00:48:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:48:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:48:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2021-03-26 00:48:27,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7399527186761229 [2021-03-26 00:48:27,939 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 626 transitions. [2021-03-26 00:48:27,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 626 transitions. [2021-03-26 00:48:27,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:27,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 626 transitions. [2021-03-26 00:48:27,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states 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:48:27,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:48:27,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:48:27,942 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 231 flow. Second operand 6 states and 626 transitions. [2021-03-26 00:48:27,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 32 transitions, 297 flow [2021-03-26 00:48:27,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 260 flow, removed 13 selfloop flow, removed 5 redundant places. [2021-03-26 00:48:27,945 INFO L241 Difference]: Finished difference. Result has 43 places, 27 transitions, 227 flow [2021-03-26 00:48:27,945 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2021-03-26 00:48:27,945 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-26 00:48:27,945 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:27,946 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 227 flow [2021-03-26 00:48:27,946 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 27 transitions, 227 flow [2021-03-26 00:48:27,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 27 transitions, 227 flow [2021-03-26 00:48:27,955 INFO L129 PetriNetUnfolder]: 13/59 cut-off events. [2021-03-26 00:48:27,955 INFO L130 PetriNetUnfolder]: For 252/255 co-relation queries the response was YES. [2021-03-26 00:48:27,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 59 events. 13/59 cut-off events. For 252/255 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 191 event pairs, 7 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 245. Up to 29 conditions per place. [2021-03-26 00:48:27,956 INFO L142 LiptonReduction]: Number of co-enabled transitions 82 [2021-03-26 00:48:28,147 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-26 00:48:28,147 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:48:28,147 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 202 [2021-03-26 00:48:28,149 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 229 flow [2021-03-26 00:48:28,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:48:28,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:28,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:28,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:48:28,150 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash 604338327, now seen corresponding path program 1 times [2021-03-26 00:48:28,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:28,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368227807] [2021-03-26 00:48:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:28,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:28,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:28,204 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:28,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:28,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:28,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:28,211 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:48:28,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368227807] [2021-03-26 00:48:28,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:28,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:28,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093690236] [2021-03-26 00:48:28,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:28,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:28,213 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2021-03-26 00:48:28,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:48:28,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:28,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2021-03-26 00:48:28,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:28,248 INFO L129 PetriNetUnfolder]: 27/87 cut-off events. [2021-03-26 00:48:28,248 INFO L130 PetriNetUnfolder]: For 253/282 co-relation queries the response was YES. [2021-03-26 00:48:28,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 87 events. 27/87 cut-off events. For 253/282 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 333 event pairs, 7 based on Foata normal form. 25/96 useless extension candidates. Maximal degree in co-relation 302. Up to 52 conditions per place. [2021-03-26 00:48:28,249 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 6 selfloop transitions, 5 changer transitions 3/28 dead transitions. [2021-03-26 00:48:28,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 28 transitions, 219 flow [2021-03-26 00:48:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2021-03-26 00:48:28,251 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8277777777777777 [2021-03-26 00:48:28,252 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2021-03-26 00:48:28,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2021-03-26 00:48:28,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:28,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2021-03-26 00:48:28,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:48:28,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 144.0) internal successors, (864), 6 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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:48:28,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 144.0) internal successors, (864), 6 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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:48:28,255 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 229 flow. Second operand 5 states and 596 transitions. [2021-03-26 00:48:28,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 28 transitions, 219 flow [2021-03-26 00:48:28,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 172 flow, removed 9 selfloop flow, removed 10 redundant places. [2021-03-26 00:48:28,256 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 161 flow [2021-03-26 00:48:28,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-26 00:48:28,257 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2021-03-26 00:48:28,257 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:28,257 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 161 flow [2021-03-26 00:48:28,257 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 161 flow [2021-03-26 00:48:28,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 161 flow [2021-03-26 00:48:28,265 INFO L129 PetriNetUnfolder]: 12/62 cut-off events. [2021-03-26 00:48:28,265 INFO L130 PetriNetUnfolder]: For 152/165 co-relation queries the response was YES. [2021-03-26 00:48:28,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 62 events. 12/62 cut-off events. For 152/165 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 226 event pairs, 8 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 227. Up to 26 conditions per place. [2021-03-26 00:48:28,265 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 00:48:28,424 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-26 00:48:28,761 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-26 00:48:28,827 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-26 00:48:28,827 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:28,828 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 571 [2021-03-26 00:48:28,828 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 165 flow [2021-03-26 00:48:28,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:48:28,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:28,829 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:28,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:48:28,829 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:28,829 INFO L82 PathProgramCache]: Analyzing trace with hash -657369993, now seen corresponding path program 1 times [2021-03-26 00:48:28,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:28,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245287085] [2021-03-26 00:48:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:28,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:28,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:28,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:28,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:28,879 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:28,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:28,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:28,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:28,886 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:48:28,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245287085] [2021-03-26 00:48:28,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:28,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:28,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039368548] [2021-03-26 00:48:28,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:28,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:28,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:28,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:28,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2021-03-26 00:48:28,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:48:28,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:28,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2021-03-26 00:48:28,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:28,940 INFO L129 PetriNetUnfolder]: 14/60 cut-off events. [2021-03-26 00:48:28,940 INFO L130 PetriNetUnfolder]: For 196/272 co-relation queries the response was YES. [2021-03-26 00:48:28,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 60 events. 14/60 cut-off events. For 196/272 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 201 event pairs, 0 based on Foata normal form. 32/85 useless extension candidates. Maximal degree in co-relation 222. Up to 27 conditions per place. [2021-03-26 00:48:28,941 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 4 selfloop transitions, 7 changer transitions 8/29 dead transitions. [2021-03-26 00:48:28,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 215 flow [2021-03-26 00:48:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:48:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:48:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2021-03-26 00:48:28,944 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8236453201970443 [2021-03-26 00:48:28,944 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2021-03-26 00:48:28,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2021-03-26 00:48:28,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:28,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2021-03-26 00:48:28,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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:48:28,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:48:28,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:48:28,948 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 165 flow. Second operand 7 states and 836 transitions. [2021-03-26 00:48:28,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 215 flow [2021-03-26 00:48:28,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 180 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:28,950 INFO L241 Difference]: Finished difference. Result has 45 places, 20 transitions, 135 flow [2021-03-26 00:48:28,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=20} [2021-03-26 00:48:28,950 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2021-03-26 00:48:28,950 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:28,951 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 20 transitions, 135 flow [2021-03-26 00:48:28,951 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 20 transitions, 135 flow [2021-03-26 00:48:28,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 20 transitions, 135 flow [2021-03-26 00:48:28,957 INFO L129 PetriNetUnfolder]: 2/23 cut-off events. [2021-03-26 00:48:28,957 INFO L130 PetriNetUnfolder]: For 53/56 co-relation queries the response was YES. [2021-03-26 00:48:28,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 23 events. 2/23 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 3/26 useless extension candidates. Maximal degree in co-relation 78. Up to 10 conditions per place. [2021-03-26 00:48:28,957 INFO L142 LiptonReduction]: Number of co-enabled transitions 40 [2021-03-26 00:48:29,586 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 00:48:29,795 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 00:48:31,736 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 332 DAG size of output: 258 [2021-03-26 00:48:32,250 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-26 00:48:32,432 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 00:48:32,863 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2021-03-26 00:48:33,014 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 00:48:33,253 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 00:48:33,540 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 00:48:34,115 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:48:34,651 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:48:34,655 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:48:34,655 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:48:34,655 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5705 [2021-03-26 00:48:34,655 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 16 transitions, 117 flow [2021-03-26 00:48:34,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:48:34,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:34,656 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:34,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:48:34,656 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2067604235, now seen corresponding path program 1 times [2021-03-26 00:48:34,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:34,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071004862] [2021-03-26 00:48:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:48:34,686 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:48:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:48:34,714 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:48:34,748 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:48:34,748 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:48:34,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:48:34,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:48:34 BasicIcfg [2021-03-26 00:48:34,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:48:34,829 INFO L168 Benchmark]: Toolchain (without parser) took 24466.23 ms. Allocated memory was 255.9 MB in the beginning and 723.5 MB in the end (delta: 467.7 MB). Free memory was 232.8 MB in the beginning and 445.1 MB in the end (delta: -212.3 MB). Peak memory consumption was 253.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:34,829 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:48:34,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.39 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 232.8 MB in the beginning and 305.9 MB in the end (delta: -73.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:34,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.91 ms. Allocated memory is still 346.0 MB. Free memory was 305.9 MB in the beginning and 303.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:48:34,829 INFO L168 Benchmark]: Boogie Preprocessor took 26.16 ms. Allocated memory is still 346.0 MB. Free memory was 303.1 MB in the beginning and 301.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:34,830 INFO L168 Benchmark]: RCFGBuilder took 1527.08 ms. Allocated memory is still 346.0 MB. Free memory was 301.0 MB in the beginning and 237.2 MB in the end (delta: 63.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:34,830 INFO L168 Benchmark]: TraceAbstraction took 22318.72 ms. Allocated memory was 346.0 MB in the beginning and 723.5 MB in the end (delta: 377.5 MB). Free memory was 236.2 MB in the beginning and 445.1 MB in the end (delta: -208.8 MB). Peak memory consumption was 168.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:34,831 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 544.39 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 232.8 MB in the beginning and 305.9 MB in the end (delta: -73.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.91 ms. Allocated memory is still 346.0 MB. Free memory was 305.9 MB in the beginning and 303.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.16 ms. Allocated memory is still 346.0 MB. Free memory was 303.1 MB in the beginning and 301.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1527.08 ms. Allocated memory is still 346.0 MB. Free memory was 301.0 MB in the beginning and 237.2 MB in the end (delta: 63.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22318.72 ms. Allocated memory was 346.0 MB in the beginning and 723.5 MB in the end (delta: 377.5 MB). Free memory was 236.2 MB in the beginning and 445.1 MB in the end (delta: -208.8 MB). Peak memory consumption was 168.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7611.5ms, 82 PlacesBefore, 37 PlacesAfterwards, 77 TransitionsBefore, 31 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, 1657 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 809, positive: 743, positive conditional: 743, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 624, positive: 593, positive conditional: 0, positive unconditional: 593, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 624, positive: 593, positive conditional: 0, positive unconditional: 593, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 624, positive: 591, positive conditional: 0, positive unconditional: 591, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 566, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 559, negative conditional: 0, negative unconditional: 559, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 809, positive: 150, positive conditional: 150, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 624, unknown conditional: 624, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3062.1ms, 35 PlacesBefore, 25 PlacesAfterwards, 24 TransitionsBefore, 18 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 34, positive conditional: 6, positive unconditional: 28, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 34, positive conditional: 6, positive unconditional: 28, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 189, negative conditional: 59, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 45, Positive conditional cache size: 45, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1134.3ms, 29 PlacesBefore, 26 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 264 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 3, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 3, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.3ms, 29 PlacesBefore, 29 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, 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: 2, positive: 2, positive conditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.5ms, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 82 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 60, Positive conditional cache size: 60, 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: 32.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 63, Positive conditional cache size: 63, 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: 716.4ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 114 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 8, 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: 9, positive: 9, positive conditional: 8, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 60, Positive conditional cache size: 60, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.2ms, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 68 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.0ms, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 86 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 17, 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: 2, positive: 2, positive conditional: 1, 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: 2, positive: 2, positive conditional: 1, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 63, Positive conditional cache size: 63, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.4ms, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 61, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 59, Positive conditional cache size: 59, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.5ms, 50 PlacesBefore, 49 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 11, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 60, Positive conditional cache size: 60, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.1ms, 46 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 57 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 2, 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: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 201.2ms, 43 PlacesBefore, 42 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 23, 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: 10, positive: 10, positive conditional: 10, 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: 10, positive: 10, positive conditional: 10, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 27, Positive conditional cache size: 27, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 570.3ms, 39 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 19, Positive conditional cache size: 19, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5704.0ms, 45 PlacesBefore, 37 PlacesAfterwards, 20 TransitionsBefore, 16 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22113.4ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1160.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7673.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 53 SDtfs, 34 SDslu, 22 SDs, 0 SdLazy, 321 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 391.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 418.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=9, InterpolantAutomatonStates: 66, 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: 41.9ms SsaConstructionTime, 364.4ms SatisfiabilityAnalysisTime, 962.5ms InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...