/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:14:27,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:14:27,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:14:27,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:14:27,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:14:27,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:14:27,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:14:27,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:14:27,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:14:27,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:14:27,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:14:27,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:14:27,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:14:27,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:14:27,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:14:27,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:14:27,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:14:27,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:14:27,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:14:27,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:14:27,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:14:27,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:14:27,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:14:27,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:14:27,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:14:27,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:14:27,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:14:27,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:14:27,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:14:27,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:14:27,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:14:27,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:14:27,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:14:27,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:14:27,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:14:27,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:14:27,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:14:27,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:14:27,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:14:27,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:14:27,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:14:27,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:14:27,316 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:14:27,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:14:27,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:14:27,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:14:27,318 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:14:27,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:14:27,319 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:14:27,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:14:27,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:14:27,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:14:27,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:14:27,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:14:27,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:14:27,320 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:14:27,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:14:27,321 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:14:27,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:14:27,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:14:27,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:14:27,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:14:27,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:14:27,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:27,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:14:27,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:14:27,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:14:27,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:14:27,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:14:27,323 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:14:27,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:14:27,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:14:27,324 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:14:27,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:14:27,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:14:27,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:14:27,694 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:14:27,694 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:14:27,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2021-03-26 10:14:27,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d161492a/b6aedd8513cd4e03994f8bf177973db4/FLAGa2765c764 [2021-03-26 10:14:28,303 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:14:28,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2021-03-26 10:14:28,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d161492a/b6aedd8513cd4e03994f8bf177973db4/FLAGa2765c764 [2021-03-26 10:14:28,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d161492a/b6aedd8513cd4e03994f8bf177973db4 [2021-03-26 10:14:28,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:14:28,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:14:28,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:28,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:14:28,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:14:28,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:28" (1/1) ... [2021-03-26 10:14:28,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316d1582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:28, skipping insertion in model container [2021-03-26 10:14:28,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:28" (1/1) ... [2021-03-26 10:14:28,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:14:28,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:14:28,851 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/mix055_pso.opt.i[948,961] [2021-03-26 10:14:29,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:29,071 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:14:29,081 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/mix055_pso.opt.i[948,961] [2021-03-26 10:14:29,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:29,190 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:14:29,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29 WrapperNode [2021-03-26 10:14:29,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:29,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:29,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:14:29,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:14:29,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:29,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:14:29,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:14:29,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:14:29,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... [2021-03-26 10:14:29,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:14:29,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:14:29,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:14:29,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:14:29,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:29,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:14:29,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:14:29,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:14:29,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:14:29,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:14:29,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:14:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:14:29,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:14:29,353 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:14:29,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:14:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:14:29,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:14:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:14:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:14:29,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:14:29,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:14:29,356 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:14:31,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:14:31,001 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:14:31,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:31 BoogieIcfgContainer [2021-03-26 10:14:31,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:14:31,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:14:31,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:14:31,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:14:31,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:14:28" (1/3) ... [2021-03-26 10:14:31,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72355af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:31, skipping insertion in model container [2021-03-26 10:14:31,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:29" (2/3) ... [2021-03-26 10:14:31,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72355af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:31, skipping insertion in model container [2021-03-26 10:14:31,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:31" (3/3) ... [2021-03-26 10:14:31,012 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2021-03-26 10:14:31,017 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:14:31,021 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:14:31,022 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:14:31,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,063 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,063 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,068 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,075 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,075 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,075 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,084 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,090 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,091 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,097 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:31,100 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:14:31,116 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:14:31,142 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:14:31,143 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:14:31,143 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:14:31,143 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:14:31,143 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:14:31,143 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:14:31,143 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:14:31,143 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:14:31,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 10:14:31,189 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 10:14:31,190 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:31,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:14:31,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 10:14:31,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:31,199 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:31,210 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:31,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:31,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:31,232 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 10:14:31,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:31,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:14:31,236 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 10:14:33,054 WARN L205 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:14:33,393 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:14:34,786 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:14:35,455 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:14:35,980 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:14:36,369 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:14:36,516 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:14:38,117 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-26 10:14:38,390 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:14:39,032 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:14:39,667 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:14:40,181 INFO L154 LiptonReduction]: Checked pairs total: 4266 [2021-03-26 10:14:40,182 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 10:14:40,184 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8986 [2021-03-26 10:14:40,191 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:14:40,192 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:40,192 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:40,192 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:40,192 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1508011334, now seen corresponding path program 1 times [2021-03-26 10:14:40,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:40,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705491686] [2021-03-26 10:14:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:40,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:40,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:40,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:40,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:40,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705491686] [2021-03-26 10:14:40,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:40,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:40,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77054693] [2021-03-26 10:14:40,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:40,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:40,510 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2021-03-26 10:14:40,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:40,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:40,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2021-03-26 10:14:40,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:40,608 INFO L129 PetriNetUnfolder]: 23/110 cut-off events. [2021-03-26 10:14:40,608 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:40,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 110 events. 23/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 9 based on Foata normal form. 6/109 useless extension candidates. Maximal degree in co-relation 150. Up to 37 conditions per place. [2021-03-26 10:14:40,611 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 7 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-26 10:14:40,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 126 flow [2021-03-26 10:14:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 10:14:40,632 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2021-03-26 10:14:40,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 10:14:40,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 10:14:40,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:40,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 10:14:40,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:40,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:40,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:40,655 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 506 transitions. [2021-03-26 10:14:40,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 126 flow [2021-03-26 10:14:40,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:14:40,660 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:40,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-26 10:14:40,662 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:14:40,662 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:40,662 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:40,663 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:40,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 86 flow [2021-03-26 10:14:40,676 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 10:14:40,676 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:40,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:14:40,677 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 10:14:41,042 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:41,173 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:41,640 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:14:41,972 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:14:42,614 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:14:43,220 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:14:44,024 INFO L154 LiptonReduction]: Checked pairs total: 1530 [2021-03-26 10:14:44,024 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 10:14:44,025 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3363 [2021-03-26 10:14:44,026 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 10:14:44,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:44,026 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:44,026 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:44,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:14:44,027 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1703571502, now seen corresponding path program 1 times [2021-03-26 10:14:44,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:44,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040097154] [2021-03-26 10:14:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:44,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:44,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:44,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:44,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:44,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:44,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:44,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040097154] [2021-03-26 10:14:44,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:44,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:44,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372154641] [2021-03-26 10:14:44,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:44,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:44,187 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 195 [2021-03-26 10:14:44,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:44,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:44,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 195 [2021-03-26 10:14:44,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:44,209 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:14:44,209 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:44,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 10:14:44,210 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:14:44,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 10:14:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-03-26 10:14:44,214 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 10:14:44,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-03-26 10:14:44,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-03-26 10:14:44,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:44,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-03-26 10:14:44,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:44,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:44,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:44,217 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 520 transitions. [2021-03-26 10:14:44,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 10:14:44,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:44,219 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:44,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 10:14:44,219 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-26 10:14:44,220 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:44,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:44,220 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:44,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:44,225 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:14:44,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:44,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:14:44,226 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 10:14:44,591 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:14:44,964 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:14:45,107 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:14:45,420 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:14:45,565 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:14:45,570 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 10:14:45,570 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:14:45,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1350 [2021-03-26 10:14:45,571 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 10:14:45,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:45,572 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:45,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:14:45,572 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash 582134895, now seen corresponding path program 1 times [2021-03-26 10:14:45,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:45,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106289659] [2021-03-26 10:14:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:45,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:45,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:45,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:14:45,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:45,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106289659] [2021-03-26 10:14:45,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:45,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:45,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435025573] [2021-03-26 10:14:45,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:45,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:45,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:45,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:45,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 197 [2021-03-26 10:14:45,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:45,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 197 [2021-03-26 10:14:45,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:45,754 INFO L129 PetriNetUnfolder]: 47/130 cut-off events. [2021-03-26 10:14:45,755 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 10:14:45,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 130 events. 47/130 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 30 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 245. Up to 67 conditions per place. [2021-03-26 10:14:45,757 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 8 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-03-26 10:14:45,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 115 flow [2021-03-26 10:14:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 619 transitions. [2021-03-26 10:14:45,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7855329949238579 [2021-03-26 10:14:45,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 619 transitions. [2021-03-26 10:14:45,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 619 transitions. [2021-03-26 10:14:45,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:45,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 619 transitions. [2021-03-26 10:14:45,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,764 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 4 states and 619 transitions. [2021-03-26 10:14:45,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 115 flow [2021-03-26 10:14:45,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:45,765 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:45,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-26 10:14:45,765 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-26 10:14:45,765 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:45,765 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:45,766 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:45,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:45,773 INFO L129 PetriNetUnfolder]: 11/59 cut-off events. [2021-03-26 10:14:45,774 INFO L130 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2021-03-26 10:14:45,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 59 events. 11/59 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 179 event pairs, 3 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 115. Up to 20 conditions per place. [2021-03-26 10:14:45,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 10:14:45,822 INFO L154 LiptonReduction]: Checked pairs total: 310 [2021-03-26 10:14:45,822 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:45,822 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-26 10:14:45,823 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:45,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:45,824 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:45,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:14:45,824 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash 438995751, now seen corresponding path program 1 times [2021-03-26 10:14:45,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:45,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653478888] [2021-03-26 10:14:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:45,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:45,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:45,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:45,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:45,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653478888] [2021-03-26 10:14:45,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:45,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:45,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640910478] [2021-03-26 10:14:45,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:45,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:45,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2021-03-26 10:14:45,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:45,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:45,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2021-03-26 10:14:45,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:46,010 INFO L129 PetriNetUnfolder]: 41/117 cut-off events. [2021-03-26 10:14:46,011 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2021-03-26 10:14:46,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 117 events. 41/117 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 416 event pairs, 21 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 288. Up to 54 conditions per place. [2021-03-26 10:14:46,013 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 10 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2021-03-26 10:14:46,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 158 flow [2021-03-26 10:14:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2021-03-26 10:14:46,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248730964467005 [2021-03-26 10:14:46,016 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2021-03-26 10:14:46,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2021-03-26 10:14:46,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:46,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2021-03-26 10:14:46,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:46,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:46,021 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:46,021 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 108 flow. Second operand 4 states and 650 transitions. [2021-03-26 10:14:46,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 158 flow [2021-03-26 10:14:46,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:14:46,023 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 133 flow [2021-03-26 10:14:46,023 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-03-26 10:14:46,023 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2021-03-26 10:14:46,023 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:46,024 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 133 flow [2021-03-26 10:14:46,024 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 133 flow [2021-03-26 10:14:46,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 133 flow [2021-03-26 10:14:46,040 INFO L129 PetriNetUnfolder]: 22/78 cut-off events. [2021-03-26 10:14:46,040 INFO L130 PetriNetUnfolder]: For 120/129 co-relation queries the response was YES. [2021-03-26 10:14:46,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 78 events. 22/78 cut-off events. For 120/129 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 259 event pairs, 9 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 189. Up to 30 conditions per place. [2021-03-26 10:14:46,043 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-26 10:14:46,254 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:14:46,651 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-26 10:14:46,782 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:14:46,831 INFO L154 LiptonReduction]: Checked pairs total: 615 [2021-03-26 10:14:46,831 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:46,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 809 [2021-03-26 10:14:46,832 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 137 flow [2021-03-26 10:14:46,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:46,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:46,833 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:46,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:14:46,833 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash -183385002, now seen corresponding path program 1 times [2021-03-26 10:14:46,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:46,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003392235] [2021-03-26 10:14:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:46,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:46,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:46,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:46,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:46,905 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:14:46,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:14:46,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:46,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:46,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003392235] [2021-03-26 10:14:46,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:46,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:46,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727988290] [2021-03-26 10:14:46,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:46,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:46,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198 [2021-03-26 10:14:46,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:46,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:46,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198 [2021-03-26 10:14:46,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:47,020 INFO L129 PetriNetUnfolder]: 44/123 cut-off events. [2021-03-26 10:14:47,021 INFO L130 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2021-03-26 10:14:47,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 123 events. 44/123 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 434 event pairs, 12 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 353. Up to 57 conditions per place. [2021-03-26 10:14:47,023 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2021-03-26 10:14:47,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 208 flow [2021-03-26 10:14:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 792 transitions. [2021-03-26 10:14:47,025 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-26 10:14:47,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 792 transitions. [2021-03-26 10:14:47,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 792 transitions. [2021-03-26 10:14:47,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:47,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 792 transitions. [2021-03-26 10:14:47,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.4) internal successors, (792), 5 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,031 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,031 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 137 flow. Second operand 5 states and 792 transitions. [2021-03-26 10:14:47,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 208 flow [2021-03-26 10:14:47,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 195 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:47,033 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 173 flow [2021-03-26 10:14:47,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2021-03-26 10:14:47,034 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 10:14:47,034 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:47,034 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 173 flow [2021-03-26 10:14:47,034 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 173 flow [2021-03-26 10:14:47,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 173 flow [2021-03-26 10:14:47,052 INFO L129 PetriNetUnfolder]: 40/113 cut-off events. [2021-03-26 10:14:47,052 INFO L130 PetriNetUnfolder]: For 296/301 co-relation queries the response was YES. [2021-03-26 10:14:47,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 113 events. 40/113 cut-off events. For 296/301 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 446 event pairs, 10 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 350. Up to 51 conditions per place. [2021-03-26 10:14:47,054 INFO L142 LiptonReduction]: Number of co-enabled transitions 532 [2021-03-26 10:14:47,110 INFO L154 LiptonReduction]: Checked pairs total: 308 [2021-03-26 10:14:47,110 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:47,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 10:14:47,115 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 173 flow [2021-03-26 10:14:47,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:47,117 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:47,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:14:47,117 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:47,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1848854390, now seen corresponding path program 1 times [2021-03-26 10:14:47,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:47,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545871619] [2021-03-26 10:14:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:47,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:47,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:47,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:47,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545871619] [2021-03-26 10:14:47,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:47,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:47,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097599399] [2021-03-26 10:14:47,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:47,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:47,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198 [2021-03-26 10:14:47,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:47,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198 [2021-03-26 10:14:47,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:47,339 INFO L129 PetriNetUnfolder]: 35/113 cut-off events. [2021-03-26 10:14:47,340 INFO L130 PetriNetUnfolder]: For 266/269 co-relation queries the response was YES. [2021-03-26 10:14:47,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 113 events. 35/113 cut-off events. For 266/269 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 420 event pairs, 5 based on Foata normal form. 3/107 useless extension candidates. Maximal degree in co-relation 343. Up to 41 conditions per place. [2021-03-26 10:14:47,341 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 11 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2021-03-26 10:14:47,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 235 flow [2021-03-26 10:14:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2021-03-26 10:14:47,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.803030303030303 [2021-03-26 10:14:47,344 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2021-03-26 10:14:47,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2021-03-26 10:14:47,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:47,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2021-03-26 10:14:47,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,347 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,347 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 173 flow. Second operand 4 states and 636 transitions. [2021-03-26 10:14:47,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 235 flow [2021-03-26 10:14:47,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 225 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:47,351 INFO L241 Difference]: Finished difference. Result has 54 places, 39 transitions, 217 flow [2021-03-26 10:14:47,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2021-03-26 10:14:47,352 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2021-03-26 10:14:47,352 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:47,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 39 transitions, 217 flow [2021-03-26 10:14:47,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 39 transitions, 217 flow [2021-03-26 10:14:47,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 39 transitions, 217 flow [2021-03-26 10:14:47,368 INFO L129 PetriNetUnfolder]: 25/90 cut-off events. [2021-03-26 10:14:47,368 INFO L130 PetriNetUnfolder]: For 294/299 co-relation queries the response was YES. [2021-03-26 10:14:47,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 90 events. 25/90 cut-off events. For 294/299 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 311 event pairs, 5 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 308. Up to 34 conditions per place. [2021-03-26 10:14:47,370 INFO L142 LiptonReduction]: Number of co-enabled transitions 574 [2021-03-26 10:14:47,375 INFO L154 LiptonReduction]: Checked pairs total: 451 [2021-03-26 10:14:47,375 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:47,375 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 10:14:47,377 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 217 flow [2021-03-26 10:14:47,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,378 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:47,378 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:47,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:14:47,378 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898248, now seen corresponding path program 1 times [2021-03-26 10:14:47,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:47,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616518924] [2021-03-26 10:14:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:47,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:47,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:47,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:47,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616518924] [2021-03-26 10:14:47,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:47,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:47,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344234191] [2021-03-26 10:14:47,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:47,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:47,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:47,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:47,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:47,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:47,576 INFO L129 PetriNetUnfolder]: 292/569 cut-off events. [2021-03-26 10:14:47,577 INFO L130 PetriNetUnfolder]: For 1405/1489 co-relation queries the response was YES. [2021-03-26 10:14:47,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 569 events. 292/569 cut-off events. For 1405/1489 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 3565 event pairs, 126 based on Foata normal form. 44/508 useless extension candidates. Maximal degree in co-relation 1675. Up to 306 conditions per place. [2021-03-26 10:14:47,584 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2021-03-26 10:14:47,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 285 flow [2021-03-26 10:14:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 847 transitions. [2021-03-26 10:14:47,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2021-03-26 10:14:47,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 847 transitions. [2021-03-26 10:14:47,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 847 transitions. [2021-03-26 10:14:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:47,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 847 transitions. [2021-03-26 10:14:47,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,591 INFO L185 Difference]: Start difference. First operand has 54 places, 39 transitions, 217 flow. Second operand 5 states and 847 transitions. [2021-03-26 10:14:47,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 285 flow [2021-03-26 10:14:47,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 260 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:47,596 INFO L241 Difference]: Finished difference. Result has 59 places, 48 transitions, 271 flow [2021-03-26 10:14:47,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2021-03-26 10:14:47,596 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2021-03-26 10:14:47,596 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:47,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 271 flow [2021-03-26 10:14:47,597 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 271 flow [2021-03-26 10:14:47,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 271 flow [2021-03-26 10:14:47,666 INFO L129 PetriNetUnfolder]: 303/569 cut-off events. [2021-03-26 10:14:47,666 INFO L130 PetriNetUnfolder]: For 903/1101 co-relation queries the response was YES. [2021-03-26 10:14:47,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 569 events. 303/569 cut-off events. For 903/1101 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3479 event pairs, 135 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 1810. Up to 336 conditions per place. [2021-03-26 10:14:47,700 INFO L142 LiptonReduction]: Number of co-enabled transitions 818 [2021-03-26 10:14:47,714 INFO L154 LiptonReduction]: Checked pairs total: 351 [2021-03-26 10:14:47,714 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:47,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-26 10:14:47,715 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 271 flow [2021-03-26 10:14:47,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:47,715 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:47,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:14:47,716 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash -819099530, now seen corresponding path program 1 times [2021-03-26 10:14:47,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:47,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320642302] [2021-03-26 10:14:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:47,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:47,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:47,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:47,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:47,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320642302] [2021-03-26 10:14:47,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:47,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:47,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327599088] [2021-03-26 10:14:47,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:47,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:47,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:47,815 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:47,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:47,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:47,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:47,938 INFO L129 PetriNetUnfolder]: 204/440 cut-off events. [2021-03-26 10:14:47,939 INFO L130 PetriNetUnfolder]: For 789/1329 co-relation queries the response was YES. [2021-03-26 10:14:47,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 440 events. 204/440 cut-off events. For 789/1329 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2627 event pairs, 31 based on Foata normal form. 86/454 useless extension candidates. Maximal degree in co-relation 1666. Up to 295 conditions per place. [2021-03-26 10:14:47,944 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 19 changer transitions 0/61 dead transitions. [2021-03-26 10:14:47,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 407 flow [2021-03-26 10:14:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1186 transitions. [2021-03-26 10:14:47,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8556998556998557 [2021-03-26 10:14:47,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1186 transitions. [2021-03-26 10:14:47,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1186 transitions. [2021-03-26 10:14:47,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:47,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1186 transitions. [2021-03-26 10:14:47,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.42857142857142) internal successors, (1186), 7 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,955 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,955 INFO L185 Difference]: Start difference. First operand has 59 places, 48 transitions, 271 flow. Second operand 7 states and 1186 transitions. [2021-03-26 10:14:47,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 407 flow [2021-03-26 10:14:47,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:47,960 INFO L241 Difference]: Finished difference. Result has 67 places, 57 transitions, 404 flow [2021-03-26 10:14:47,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2021-03-26 10:14:47,961 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2021-03-26 10:14:47,961 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:47,961 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 57 transitions, 404 flow [2021-03-26 10:14:47,961 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 57 transitions, 404 flow [2021-03-26 10:14:47,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 57 transitions, 404 flow [2021-03-26 10:14:48,021 INFO L129 PetriNetUnfolder]: 206/434 cut-off events. [2021-03-26 10:14:48,021 INFO L130 PetriNetUnfolder]: For 1596/2387 co-relation queries the response was YES. [2021-03-26 10:14:48,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 434 events. 206/434 cut-off events. For 1596/2387 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 2646 event pairs, 31 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 1945. Up to 295 conditions per place. [2021-03-26 10:14:48,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 1030 [2021-03-26 10:14:48,041 INFO L154 LiptonReduction]: Checked pairs total: 425 [2021-03-26 10:14:48,041 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:48,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 80 [2021-03-26 10:14:48,042 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 404 flow [2021-03-26 10:14:48,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:48,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:48,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:14:48,043 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1047574259, now seen corresponding path program 1 times [2021-03-26 10:14:48,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:48,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570895857] [2021-03-26 10:14:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:48,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:48,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:48,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570895857] [2021-03-26 10:14:48,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:48,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:48,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886584589] [2021-03-26 10:14:48,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:48,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:48,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-26 10:14:48,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:48,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-26 10:14:48,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:48,183 INFO L129 PetriNetUnfolder]: 300/612 cut-off events. [2021-03-26 10:14:48,183 INFO L130 PetriNetUnfolder]: For 2549/3736 co-relation queries the response was YES. [2021-03-26 10:14:48,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2889 conditions, 612 events. 300/612 cut-off events. For 2549/3736 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 3787 event pairs, 45 based on Foata normal form. 31/528 useless extension candidates. Maximal degree in co-relation 2860. Up to 461 conditions per place. [2021-03-26 10:14:48,191 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 3 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2021-03-26 10:14:48,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 416 flow [2021-03-26 10:14:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-03-26 10:14:48,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.898989898989899 [2021-03-26 10:14:48,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-03-26 10:14:48,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-03-26 10:14:48,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:48,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-03-26 10:14:48,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,196 INFO L185 Difference]: Start difference. First operand has 67 places, 57 transitions, 404 flow. Second operand 3 states and 534 transitions. [2021-03-26 10:14:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 416 flow [2021-03-26 10:14:48,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 57 transitions, 366 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:48,202 INFO L241 Difference]: Finished difference. Result has 67 places, 57 transitions, 365 flow [2021-03-26 10:14:48,202 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2021-03-26 10:14:48,203 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2021-03-26 10:14:48,203 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:48,203 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 57 transitions, 365 flow [2021-03-26 10:14:48,203 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 57 transitions, 365 flow [2021-03-26 10:14:48,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 57 transitions, 365 flow [2021-03-26 10:14:48,261 INFO L129 PetriNetUnfolder]: 301/614 cut-off events. [2021-03-26 10:14:48,261 INFO L130 PetriNetUnfolder]: For 2287/2583 co-relation queries the response was YES. [2021-03-26 10:14:48,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2564 conditions, 614 events. 301/614 cut-off events. For 2287/2583 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 3945 event pairs, 45 based on Foata normal form. 5/504 useless extension candidates. Maximal degree in co-relation 2537. Up to 400 conditions per place. [2021-03-26 10:14:48,272 INFO L142 LiptonReduction]: Number of co-enabled transitions 1030 [2021-03-26 10:14:48,285 INFO L154 LiptonReduction]: Checked pairs total: 469 [2021-03-26 10:14:48,285 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:48,285 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-03-26 10:14:48,285 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 365 flow [2021-03-26 10:14:48,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:48,286 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:48,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:14:48,288 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash -580099168, now seen corresponding path program 1 times [2021-03-26 10:14:48,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:48,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584425470] [2021-03-26 10:14:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:48,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:48,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584425470] [2021-03-26 10:14:48,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:48,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:14:48,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721453061] [2021-03-26 10:14:48,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:48,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:48,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:48,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:48,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:48,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:48,518 INFO L129 PetriNetUnfolder]: 228/484 cut-off events. [2021-03-26 10:14:48,518 INFO L130 PetriNetUnfolder]: For 2106/3673 co-relation queries the response was YES. [2021-03-26 10:14:48,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2373 conditions, 484 events. 228/484 cut-off events. For 2106/3673 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 2896 event pairs, 4 based on Foata normal form. 129/508 useless extension candidates. Maximal degree in co-relation 2344. Up to 326 conditions per place. [2021-03-26 10:14:48,524 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 28 changer transitions 4/68 dead transitions. [2021-03-26 10:14:48,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 546 flow [2021-03-26 10:14:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:14:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:14:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1525 transitions. [2021-03-26 10:14:48,528 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557800224466892 [2021-03-26 10:14:48,528 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1525 transitions. [2021-03-26 10:14:48,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1525 transitions. [2021-03-26 10:14:48,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:48,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1525 transitions. [2021-03-26 10:14:48,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.44444444444446) internal successors, (1525), 9 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,536 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,536 INFO L185 Difference]: Start difference. First operand has 67 places, 57 transitions, 365 flow. Second operand 9 states and 1525 transitions. [2021-03-26 10:14:48,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 546 flow [2021-03-26 10:14:48,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 68 transitions, 535 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:48,542 INFO L241 Difference]: Finished difference. Result has 75 places, 64 transitions, 511 flow [2021-03-26 10:14:48,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=511, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2021-03-26 10:14:48,543 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2021-03-26 10:14:48,543 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:48,544 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 64 transitions, 511 flow [2021-03-26 10:14:48,544 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 64 transitions, 511 flow [2021-03-26 10:14:48,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 64 transitions, 511 flow [2021-03-26 10:14:48,589 INFO L129 PetriNetUnfolder]: 210/460 cut-off events. [2021-03-26 10:14:48,589 INFO L130 PetriNetUnfolder]: For 2545/2838 co-relation queries the response was YES. [2021-03-26 10:14:48,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 460 events. 210/460 cut-off events. For 2545/2838 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 2896 event pairs, 4 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 2404. Up to 302 conditions per place. [2021-03-26 10:14:48,598 INFO L142 LiptonReduction]: Number of co-enabled transitions 1100 [2021-03-26 10:14:48,632 INFO L154 LiptonReduction]: Checked pairs total: 1223 [2021-03-26 10:14:48,632 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:48,632 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-26 10:14:48,634 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 485 flow [2021-03-26 10:14:48,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,635 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:48,635 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:48,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:14:48,635 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:48,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2143164564, now seen corresponding path program 1 times [2021-03-26 10:14:48,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:48,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70029655] [2021-03-26 10:14:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:48,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:48,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70029655] [2021-03-26 10:14:48,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:48,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:14:48,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965933035] [2021-03-26 10:14:48,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:14:48,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:14:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:14:48,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:48,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 485 flow. Second operand has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:48,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:48,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:48,818 INFO L129 PetriNetUnfolder]: 68/166 cut-off events. [2021-03-26 10:14:48,819 INFO L130 PetriNetUnfolder]: For 1027/1545 co-relation queries the response was YES. [2021-03-26 10:14:48,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 166 events. 68/166 cut-off events. For 1027/1545 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 659 event pairs, 0 based on Foata normal form. 46/178 useless extension candidates. Maximal degree in co-relation 863. Up to 121 conditions per place. [2021-03-26 10:14:48,821 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 2 selfloop transitions, 18 changer transitions 4/54 dead transitions. [2021-03-26 10:14:48,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 54 transitions, 457 flow [2021-03-26 10:14:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:14:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:14:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1346 transitions. [2021-03-26 10:14:48,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8497474747474747 [2021-03-26 10:14:48,825 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1346 transitions. [2021-03-26 10:14:48,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1346 transitions. [2021-03-26 10:14:48,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:48,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1346 transitions. [2021-03-26 10:14:48,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 168.25) internal successors, (1346), 8 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,831 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,831 INFO L185 Difference]: Start difference. First operand has 75 places, 61 transitions, 485 flow. Second operand 8 states and 1346 transitions. [2021-03-26 10:14:48,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 54 transitions, 457 flow [2021-03-26 10:14:48,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 54 transitions, 370 flow, removed 34 selfloop flow, removed 9 redundant places. [2021-03-26 10:14:48,838 INFO L241 Difference]: Finished difference. Result has 68 places, 50 transitions, 334 flow [2021-03-26 10:14:48,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2021-03-26 10:14:48,838 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-26 10:14:48,838 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:48,838 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 50 transitions, 334 flow [2021-03-26 10:14:48,839 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 50 transitions, 334 flow [2021-03-26 10:14:48,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 50 transitions, 334 flow [2021-03-26 10:14:48,854 INFO L129 PetriNetUnfolder]: 62/158 cut-off events. [2021-03-26 10:14:48,854 INFO L130 PetriNetUnfolder]: For 349/451 co-relation queries the response was YES. [2021-03-26 10:14:48,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 158 events. 62/158 cut-off events. For 349/451 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 715 event pairs, 0 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 626. Up to 71 conditions per place. [2021-03-26 10:14:48,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 642 [2021-03-26 10:14:49,561 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 10:14:49,822 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:14:51,781 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 339 DAG size of output: 264 [2021-03-26 10:14:52,411 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:14:52,663 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:14:52,895 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:14:53,417 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:14:53,942 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:14:53,952 INFO L154 LiptonReduction]: Checked pairs total: 1169 [2021-03-26 10:14:53,952 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:53,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5115 [2021-03-26 10:14:53,953 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 318 flow [2021-03-26 10:14:53,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:53,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:53,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:53,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:14:53,954 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -476479019, now seen corresponding path program 1 times [2021-03-26 10:14:53,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:53,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078773855] [2021-03-26 10:14:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:53,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:53,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:53,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:53,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:53,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:53,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:53,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078773855] [2021-03-26 10:14:53,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:53,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:53,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209567129] [2021-03-26 10:14:53,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:53,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:53,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 200 [2021-03-26 10:14:53,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:53,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:53,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 200 [2021-03-26 10:14:53,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:54,042 INFO L129 PetriNetUnfolder]: 128/278 cut-off events. [2021-03-26 10:14:54,042 INFO L130 PetriNetUnfolder]: For 716/909 co-relation queries the response was YES. [2021-03-26 10:14:54,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 278 events. 128/278 cut-off events. For 716/909 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1392 event pairs, 0 based on Foata normal form. 7/228 useless extension candidates. Maximal degree in co-relation 1069. Up to 108 conditions per place. [2021-03-26 10:14:54,045 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2021-03-26 10:14:54,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 330 flow [2021-03-26 10:14:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-03-26 10:14:54,048 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8725 [2021-03-26 10:14:54,048 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-03-26 10:14:54,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-03-26 10:14:54,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:54,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-03-26 10:14:54,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,052 INFO L185 Difference]: Start difference. First operand has 64 places, 47 transitions, 318 flow. Second operand 4 states and 698 transitions. [2021-03-26 10:14:54,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 48 transitions, 330 flow [2021-03-26 10:14:54,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 261 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-26 10:14:54,056 INFO L241 Difference]: Finished difference. Result has 61 places, 46 transitions, 252 flow [2021-03-26 10:14:54,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2021-03-26 10:14:54,056 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-26 10:14:54,056 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:54,056 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 46 transitions, 252 flow [2021-03-26 10:14:54,057 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 46 transitions, 252 flow [2021-03-26 10:14:54,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 46 transitions, 252 flow [2021-03-26 10:14:54,069 INFO L129 PetriNetUnfolder]: 67/157 cut-off events. [2021-03-26 10:14:54,069 INFO L130 PetriNetUnfolder]: For 173/189 co-relation queries the response was YES. [2021-03-26 10:14:54,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 157 events. 67/157 cut-off events. For 173/189 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 732 event pairs, 0 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 445. Up to 48 conditions per place. [2021-03-26 10:14:54,071 INFO L142 LiptonReduction]: Number of co-enabled transitions 514 [2021-03-26 10:14:54,161 INFO L154 LiptonReduction]: Checked pairs total: 348 [2021-03-26 10:14:54,161 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:54,162 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 10:14:54,162 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 250 flow [2021-03-26 10:14:54,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,163 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:54,163 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:54,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:14:54,163 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:54,163 INFO L82 PathProgramCache]: Analyzing trace with hash 71605899, now seen corresponding path program 1 times [2021-03-26 10:14:54,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:54,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673368132] [2021-03-26 10:14:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:54,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:54,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:54,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:54,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:54,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:54,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:54,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673368132] [2021-03-26 10:14:54,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:54,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:54,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032626168] [2021-03-26 10:14:54,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:54,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:54,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:54,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:54,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 203 [2021-03-26 10:14:54,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:54,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 203 [2021-03-26 10:14:54,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:54,313 INFO L129 PetriNetUnfolder]: 128/285 cut-off events. [2021-03-26 10:14:54,313 INFO L130 PetriNetUnfolder]: For 462/524 co-relation queries the response was YES. [2021-03-26 10:14:54,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 285 events. 128/285 cut-off events. For 462/524 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1415 event pairs, 0 based on Foata normal form. 11/265 useless extension candidates. Maximal degree in co-relation 835. Up to 94 conditions per place. [2021-03-26 10:14:54,315 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 3 selfloop transitions, 1 changer transitions 7/45 dead transitions. [2021-03-26 10:14:54,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 45 transitions, 262 flow [2021-03-26 10:14:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 710 transitions. [2021-03-26 10:14:54,321 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.874384236453202 [2021-03-26 10:14:54,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 710 transitions. [2021-03-26 10:14:54,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 710 transitions. [2021-03-26 10:14:54,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:54,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 710 transitions. [2021-03-26 10:14:54,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,325 INFO L185 Difference]: Start difference. First operand has 59 places, 44 transitions, 250 flow. Second operand 4 states and 710 transitions. [2021-03-26 10:14:54,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 45 transitions, 262 flow [2021-03-26 10:14:54,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 45 transitions, 257 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:54,328 INFO L241 Difference]: Finished difference. Result has 61 places, 38 transitions, 212 flow [2021-03-26 10:14:54,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2021-03-26 10:14:54,328 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-26 10:14:54,328 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:54,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 38 transitions, 212 flow [2021-03-26 10:14:54,329 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 38 transitions, 212 flow [2021-03-26 10:14:54,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 38 transitions, 212 flow [2021-03-26 10:14:54,340 INFO L129 PetriNetUnfolder]: 63/149 cut-off events. [2021-03-26 10:14:54,340 INFO L130 PetriNetUnfolder]: For 178/187 co-relation queries the response was YES. [2021-03-26 10:14:54,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 149 events. 63/149 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 629 event pairs, 0 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 431. Up to 52 conditions per place. [2021-03-26 10:14:54,342 INFO L142 LiptonReduction]: Number of co-enabled transitions 260 [2021-03-26 10:14:54,344 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:14:54,344 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:54,344 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 10:14:54,346 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 212 flow [2021-03-26 10:14:54,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,346 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:54,346 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:54,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:14:54,346 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1936448239, now seen corresponding path program 1 times [2021-03-26 10:14:54,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:54,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493259359] [2021-03-26 10:14:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:54,371 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:54,403 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:54,443 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:14:54,444 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:14:54,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:14:54,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:14:54 BasicIcfg [2021-03-26 10:14:54,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:14:54,550 INFO L168 Benchmark]: Toolchain (without parser) took 25920.98 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 620.3 MB in the end (delta: -387.5 MB). Peak memory consumption was 78.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:54,550 INFO L168 Benchmark]: CDTParser took 0.46 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 10:14:54,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.45 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 232.2 MB in the beginning and 347.6 MB in the end (delta: -115.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:54,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.48 ms. Allocated memory is still 388.0 MB. Free memory was 347.6 MB in the beginning and 344.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:54,551 INFO L168 Benchmark]: Boogie Preprocessor took 26.53 ms. Allocated memory is still 388.0 MB. Free memory was 344.8 MB in the beginning and 342.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:54,554 INFO L168 Benchmark]: RCFGBuilder took 1717.75 ms. Allocated memory is still 388.0 MB. Free memory was 342.7 MB in the beginning and 261.4 MB in the end (delta: 81.3 MB). Peak memory consumption was 82.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:54,557 INFO L168 Benchmark]: TraceAbstraction took 23537.06 ms. Allocated memory was 388.0 MB in the beginning and 723.5 MB in the end (delta: 335.5 MB). Free memory was 260.3 MB in the beginning and 620.3 MB in the end (delta: -359.9 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:14:54,558 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.46 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 568.45 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 232.2 MB in the beginning and 347.6 MB in the end (delta: -115.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.48 ms. Allocated memory is still 388.0 MB. Free memory was 347.6 MB in the beginning and 344.8 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.53 ms. Allocated memory is still 388.0 MB. Free memory was 344.8 MB in the beginning and 342.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1717.75 ms. Allocated memory is still 388.0 MB. Free memory was 342.7 MB in the beginning and 261.4 MB in the end (delta: 81.3 MB). Peak memory consumption was 82.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23537.06 ms. Allocated memory was 388.0 MB in the beginning and 723.5 MB in the end (delta: 335.5 MB). Free memory was 260.3 MB in the beginning and 620.3 MB in the end (delta: -359.9 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8969.3ms, 120 PlacesBefore, 57 PlacesAfterwards, 109 TransitionsBefore, 45 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 4266 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 2237, positive unconditional: 0, negative: 99, negative conditional: 99, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 0, positive unconditional: 2237, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 0, positive unconditional: 2237, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1657, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1657, positive: 1594, positive conditional: 0, positive unconditional: 1594, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 790, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 728, negative conditional: 0, negative unconditional: 728, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2336, positive: 625, positive conditional: 0, positive unconditional: 625, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1657, unknown conditional: 0, unknown unconditional: 1657] , Statistics on independence cache: Total cache size (in pairs): 1657, Positive cache size: 1612, Positive conditional cache size: 0, Positive unconditional cache size: 1612, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3361.3ms, 53 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1530 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 337, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, positive: 337, positive conditional: 47, positive unconditional: 290, negative: 93, negative conditional: 22, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 47, positive unconditional: 290, negative: 93, negative conditional: 22, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 56, positive conditional: 7, positive unconditional: 49, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 364, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 345, negative conditional: 164, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 430, positive: 281, positive conditional: 40, positive unconditional: 241, negative: 73, negative conditional: 15, negative unconditional: 58, unknown: 76, unknown conditional: 14, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1668, Positive conditional cache size: 7, Positive unconditional cache size: 1661, Negative cache size: 65, Negative conditional cache size: 7, Negative unconditional cache size: 58, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1349.7ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 181, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 241, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 241, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1746, Positive cache size: 1679, Positive conditional cache size: 7, Positive unconditional cache size: 1672, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.3ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 310 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 57, positive conditional: 7, positive unconditional: 50, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1752, Positive cache size: 1685, Positive conditional cache size: 12, Positive unconditional cache size: 1673, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 807.4ms, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 615 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, positive: 117, positive conditional: 25, positive unconditional: 92, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 117, positive conditional: 25, positive unconditional: 92, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, positive: 106, positive conditional: 20, positive unconditional: 86, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1763, Positive cache size: 1696, Positive conditional cache size: 17, Positive unconditional cache size: 1679, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76.0ms, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 308 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, positive: 90, positive conditional: 90, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, positive: 90, positive conditional: 30, positive unconditional: 60, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 90, positive conditional: 30, positive unconditional: 60, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 21, positive conditional: 10, positive unconditional: 11, 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: 23, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 69, positive conditional: 20, positive unconditional: 49, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 23, unknown conditional: 10, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1786, Positive cache size: 1717, Positive conditional cache size: 27, Positive unconditional cache size: 1690, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 451 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, positive: 120, positive conditional: 38, positive unconditional: 82, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, positive: 120, positive conditional: 38, positive unconditional: 82, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 3, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, positive: 114, positive conditional: 35, positive unconditional: 79, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1792, Positive cache size: 1723, Positive conditional cache size: 30, Positive unconditional cache size: 1693, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 351 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, positive: 121, positive conditional: 121, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, positive: 121, positive conditional: 51, positive unconditional: 70, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 121, positive conditional: 51, positive unconditional: 70, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 11, positive unconditional: 12, 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: 23, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 133, positive: 98, positive conditional: 40, positive unconditional: 58, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1815, Positive cache size: 1746, Positive conditional cache size: 41, Positive unconditional cache size: 1705, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.1ms, 67 PlacesBefore, 67 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 425 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, positive: 145, positive conditional: 145, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, positive: 145, positive conditional: 63, positive unconditional: 82, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 145, positive conditional: 63, positive unconditional: 82, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, positive: 141, positive conditional: 61, positive unconditional: 80, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1750, Positive conditional cache size: 43, Positive unconditional cache size: 1707, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.8ms, 67 PlacesBefore, 67 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 469 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, positive: 103, positive conditional: 32, positive unconditional: 71, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 103, positive conditional: 32, positive unconditional: 71, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 103, positive conditional: 32, positive unconditional: 71, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1750, Positive conditional cache size: 43, Positive unconditional cache size: 1707, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.5ms, 75 PlacesBefore, 75 PlacesAfterwards, 64 TransitionsBefore, 61 TransitionsAfterwards, 1100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1223 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, positive: 255, positive conditional: 255, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, positive: 255, positive conditional: 176, positive unconditional: 79, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, positive: 255, positive conditional: 176, positive unconditional: 79, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 285, positive: 252, positive conditional: 173, positive unconditional: 79, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1822, Positive cache size: 1753, Positive conditional cache size: 46, Positive unconditional cache size: 1707, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5113.9ms, 68 PlacesBefore, 64 PlacesAfterwards, 50 TransitionsBefore, 47 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1169 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 522, positive: 477, positive conditional: 477, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 522, positive: 477, positive conditional: 296, positive unconditional: 181, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 522, positive: 477, positive conditional: 296, positive unconditional: 181, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 522, positive: 473, positive conditional: 292, positive unconditional: 181, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1826, Positive cache size: 1757, Positive conditional cache size: 50, Positive unconditional cache size: 1707, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 85 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.0ms, 61 PlacesBefore, 59 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 348 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 157, positive conditional: 157, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, positive: 157, positive conditional: 61, positive unconditional: 96, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 157, positive conditional: 61, positive unconditional: 96, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 148, positive conditional: 61, positive unconditional: 87, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1838, Positive cache size: 1766, Positive conditional cache size: 50, Positive unconditional cache size: 1716, Negative cache size: 72, Negative conditional cache size: 7, Negative unconditional cache size: 65, Eliminated conditions: 103 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.5ms, 61 PlacesBefore, 58 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1838, Positive cache size: 1766, Positive conditional cache size: 50, Positive unconditional cache size: 1716, Negative cache size: 72, Negative conditional cache size: 7, Negative unconditional cache size: 65, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1469; [L837] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1470; [L839] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1471; [L841] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1472; [L843] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23305.4ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1279.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9044.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 48 SDtfs, 26 SDslu, 26 SDs, 0 SdLazy, 276 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 299.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 238.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=511occurred in iteration=10, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.5ms SsaConstructionTime, 441.8ms SatisfiabilityAnalysisTime, 930.1ms InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...