/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:05:25,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:05:25,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:05:25,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:05:25,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:05:25,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:05:25,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:05:25,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:05:25,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:05:25,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:05:25,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:05:25,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:05:25,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:05:25,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:05:25,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:05:25,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:05:25,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:05:25,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:05:25,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:05:25,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:05:25,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:05:25,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:05:25,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:05:25,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:05:25,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:05:25,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:05:25,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:05:25,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:05:25,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:05:25,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:05:25,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:05:25,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:05:25,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:05:25,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:05:25,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:05:25,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:05:25,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:05:25,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:05:25,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:05:25,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:05:25,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:05:25,363 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:05:25,382 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:05:25,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:05:25,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:05:25,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:05:25,384 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:05:25,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:05:25,384 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:05:25,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:05:25,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:05:25,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:05:25,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:05:25,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:05:25,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:05:25,386 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:05:25,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:05:25,386 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:05:25,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:05:25,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:05:25,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:05:25,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:05:25,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:05:25,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:05:25,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:05:25,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:05:25,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:05:25,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:05:25,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:05:25,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:05:25,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:05:25,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:05:25,389 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:05:25,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:05:25,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:05:25,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:05:25,720 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:05:25,720 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:05:25,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-03-26 10:05:25,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37969d88/3a856bf37f09475e9e34ea38e39ecc6e/FLAG5407320f3 [2021-03-26 10:05:26,260 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:05:26,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-03-26 10:05:26,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37969d88/3a856bf37f09475e9e34ea38e39ecc6e/FLAG5407320f3 [2021-03-26 10:05:26,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37969d88/3a856bf37f09475e9e34ea38e39ecc6e [2021-03-26 10:05:26,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:05:26,804 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:05:26,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:05:26,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:05:26,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:05:26,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:05:26" (1/1) ... [2021-03-26 10:05:26,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d812095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:26, skipping insertion in model container [2021-03-26 10:05:26,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:05:26" (1/1) ... [2021-03-26 10:05:26,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:05:26,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:05:26,988 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/mix033_tso.oepc.i[949,962] [2021-03-26 10:05:27,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:05:27,197 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:05:27,210 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/mix033_tso.oepc.i[949,962] [2021-03-26 10:05:27,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:05:27,347 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:05:27,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27 WrapperNode [2021-03-26 10:05:27,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:05:27,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:05:27,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:05:27,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:05:27,355 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:05:27" (1/1) ... [2021-03-26 10:05:27,370 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:05:27" (1/1) ... [2021-03-26 10:05:27,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:05:27,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:05:27,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:05:27,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:05:27,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (1/1) ... [2021-03-26 10:05:27,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:05:27,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:05:27,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:05:27,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:05:27,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (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:05:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:05:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:05:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:05:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:05:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:05:27,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:05:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:05:27,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:05:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:05:27,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:05:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:05:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:05:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:05:27,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:05:27,526 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:05:29,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:05:29,479 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:05:29,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:05:29 BoogieIcfgContainer [2021-03-26 10:05:29,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:05:29,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:05:29,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:05:29,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:05:29,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:05:26" (1/3) ... [2021-03-26 10:05:29,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbdf0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:05:29, skipping insertion in model container [2021-03-26 10:05:29,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:05:27" (2/3) ... [2021-03-26 10:05:29,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbdf0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:05:29, skipping insertion in model container [2021-03-26 10:05:29,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:05:29" (3/3) ... [2021-03-26 10:05:29,487 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2021-03-26 10:05:29,492 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:05:29,496 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:05:29,496 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:05:29,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:05:29,544 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:05:29,559 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:05:29,576 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:05:29,576 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:05:29,576 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:05:29,576 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:05:29,577 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:05:29,577 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:05:29,577 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:05:29,577 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:05:29,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-03-26 10:05:29,617 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-03-26 10:05:29,618 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:05:29,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-26 10:05:29,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-03-26 10:05:29,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-03-26 10:05:29,626 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:29,636 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2021-03-26 10:05:29,639 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2021-03-26 10:05:29,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2021-03-26 10:05:29,659 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-03-26 10:05:29,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:05:29,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-26 10:05:29,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 2042 [2021-03-26 10:05:31,493 WARN L205 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-26 10:05:31,850 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:05:33,247 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-26 10:05:33,834 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:05:34,072 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:05:34,490 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:05:34,620 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:05:36,114 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-26 10:05:36,388 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:05:36,984 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:05:37,673 WARN L205 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:05:37,899 INFO L154 LiptonReduction]: Checked pairs total: 3464 [2021-03-26 10:05:37,899 INFO L156 LiptonReduction]: Total number of compositions: 69 [2021-03-26 10:05:37,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8276 [2021-03-26 10:05:37,910 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-26 10:05:37,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:05:37,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:37,911 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:05:37,911 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1125728361, now seen corresponding path program 1 times [2021-03-26 10:05:37,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:37,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616390166] [2021-03-26 10:05:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:38,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:38,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:38,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:38,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:38,122 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:05:38,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616390166] [2021-03-26 10:05:38,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:38,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:05:38,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801747265] [2021-03-26 10:05:38,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:05:38,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:05:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:05:38,145 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 175 [2021-03-26 10:05:38,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:38,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:38,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 175 [2021-03-26 10:05:38,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:38,281 INFO L129 PetriNetUnfolder]: 69/205 cut-off events. [2021-03-26 10:05:38,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:05:38,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 205 events. 69/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 966 event pairs, 39 based on Foata normal form. 11/197 useless extension candidates. Maximal degree in co-relation 312. Up to 89 conditions per place. [2021-03-26 10:05:38,286 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 9 selfloop transitions, 2 changer transitions 5/45 dead transitions. [2021-03-26 10:05:38,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 125 flow [2021-03-26 10:05:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:05:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:05:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-03-26 10:05:38,306 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8990476190476191 [2021-03-26 10:05:38,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-03-26 10:05:38,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-03-26 10:05:38,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:38,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-03-26 10:05:38,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have 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:05:38,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:38,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:38,335 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 472 transitions. [2021-03-26 10:05:38,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 125 flow [2021-03-26 10:05:38,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:05:38,339 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 82 flow [2021-03-26 10:05:38,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-03-26 10:05:38,342 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 10:05:38,342 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:38,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 82 flow [2021-03-26 10:05:38,343 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 82 flow [2021-03-26 10:05:38,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-26 10:05:38,350 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 10:05:38,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:05:38,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:05:38,351 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-26 10:05:39,025 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 10:05:39,371 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 10:05:40,554 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-26 10:05:41,189 WARN L205 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:05:41,995 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-26 10:05:42,152 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-26 10:05:42,203 INFO L154 LiptonReduction]: Checked pairs total: 1266 [2021-03-26 10:05:42,203 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:05:42,204 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3862 [2021-03-26 10:05:42,205 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 10:05:42,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:42,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:42,205 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:05:42,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:05:42,206 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -921272129, now seen corresponding path program 1 times [2021-03-26 10:05:42,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:42,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361981749] [2021-03-26 10:05:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:42,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:42,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:42,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:42,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:42,302 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:05:42,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:05:42,306 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:05:42,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361981749] [2021-03-26 10:05:42,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:42,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:05:42,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000638830] [2021-03-26 10:05:42,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:05:42,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:05:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:05:42,310 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 186 [2021-03-26 10:05:42,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have 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:05:42,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:42,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 186 [2021-03-26 10:05:42,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:42,324 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-26 10:05:42,324 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:05:42,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:05:42,325 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 1 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2021-03-26 10:05:42,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 66 flow [2021-03-26 10:05:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:05:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:05:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2021-03-26 10:05:42,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8727598566308243 [2021-03-26 10:05:42,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2021-03-26 10:05:42,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2021-03-26 10:05:42,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:42,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2021-03-26 10:05:42,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have 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:05:42,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:05:42,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:05:42,331 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 3 states and 487 transitions. [2021-03-26 10:05:42,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 66 flow [2021-03-26 10:05:42,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:05:42,332 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 62 flow [2021-03-26 10:05:42,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 10:05:42,332 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2021-03-26 10:05:42,333 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:42,333 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 62 flow [2021-03-26 10:05:42,333 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 62 flow [2021-03-26 10:05:42,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2021-03-26 10:05:42,336 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:05:42,337 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:05:42,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:05:42,337 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 10:05:43,144 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:05:43,292 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:05:43,618 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:05:43,776 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:05:43,779 INFO L154 LiptonReduction]: Checked pairs total: 771 [2021-03-26 10:05:43,780 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:05:43,780 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1447 [2021-03-26 10:05:43,781 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:05:43,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have 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:05:43,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:43,781 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:05:43,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:05:43,782 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash 900137721, now seen corresponding path program 1 times [2021-03-26 10:05:43,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:43,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836993053] [2021-03-26 10:05:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:43,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:43,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:43,844 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:05:43,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836993053] [2021-03-26 10:05:43,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:43,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:05:43,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940034643] [2021-03-26 10:05:43,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:05:43,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:05:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:05:43,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 189 [2021-03-26 10:05:43,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:05:43,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:43,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 189 [2021-03-26 10:05:43,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:43,859 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:05:43,859 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:05:43,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:05:43,860 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 10:05:43,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 21 transitions, 62 flow [2021-03-26 10:05:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:05:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:05:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2021-03-26 10:05:43,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2021-03-26 10:05:43,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2021-03-26 10:05:43,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2021-03-26 10:05:43,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:43,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2021-03-26 10:05:43,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:05:43,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:05:43,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:05:43,865 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 502 transitions. [2021-03-26 10:05:43,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 21 transitions, 62 flow [2021-03-26 10:05:43,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:05:43,866 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-26 10:05:43,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-26 10:05:43,867 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2021-03-26 10:05:43,867 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:43,867 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:05:43,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:05:43,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-26 10:05:43,871 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:05:43,871 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:05:43,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:05:43,871 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 10:05:43,873 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-26 10:05:43,873 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:05:43,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-26 10:05:43,874 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2021-03-26 10:05:43,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:05:43,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:43,875 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:05:43,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:05:43,875 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1299979742, now seen corresponding path program 1 times [2021-03-26 10:05:43,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:43,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425434998] [2021-03-26 10:05:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:43,995 INFO L142 QuantifierPusher]: treesize reduction 10, result has 44.4 percent of original size [2021-03-26 10:05:43,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:05:44,007 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-03-26 10:05:44,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:05:44,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:05:44,020 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:05:44,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425434998] [2021-03-26 10:05:44,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:44,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:05:44,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763834841] [2021-03-26 10:05:44,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:05:44,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:05:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:05:44,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 189 [2021-03-26 10:05:44,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have 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:05:44,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:44,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 189 [2021-03-26 10:05:44,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:44,101 INFO L129 PetriNetUnfolder]: 63/137 cut-off events. [2021-03-26 10:05:44,101 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 10:05:44,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 137 events. 63/137 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 553 event pairs, 19 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 281. Up to 97 conditions per place. [2021-03-26 10:05:44,106 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 10 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2021-03-26 10:05:44,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 101 flow [2021-03-26 10:05:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:05:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:05:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2021-03-26 10:05:44,109 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8359788359788359 [2021-03-26 10:05:44,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2021-03-26 10:05:44,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2021-03-26 10:05:44,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:44,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2021-03-26 10:05:44,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have 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:05:44,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:05:44,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:05:44,113 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 3 states and 474 transitions. [2021-03-26 10:05:44,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 101 flow [2021-03-26 10:05:44,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 97 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:05:44,114 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 82 flow [2021-03-26 10:05:44,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-03-26 10:05:44,115 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -19 predicate places. [2021-03-26 10:05:44,115 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:44,115 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 82 flow [2021-03-26 10:05:44,116 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 82 flow [2021-03-26 10:05:44,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 82 flow [2021-03-26 10:05:44,127 INFO L129 PetriNetUnfolder]: 14/50 cut-off events. [2021-03-26 10:05:44,127 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-03-26 10:05:44,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 50 events. 14/50 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 6 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 99. Up to 29 conditions per place. [2021-03-26 10:05:44,128 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-26 10:05:44,242 INFO L154 LiptonReduction]: Checked pairs total: 189 [2021-03-26 10:05:44,242 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:05:44,242 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 127 [2021-03-26 10:05:44,243 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 82 flow [2021-03-26 10:05:44,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have 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:05:44,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:44,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:05:44,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:05:44,244 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash 553167395, now seen corresponding path program 1 times [2021-03-26 10:05:44,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:44,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689531414] [2021-03-26 10:05:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:44,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:44,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:44,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:44,340 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:05:44,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689531414] [2021-03-26 10:05:44,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:44,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:05:44,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658754133] [2021-03-26 10:05:44,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:05:44,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:05:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:05:44,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2021-03-26 10:05:44,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 82 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:05:44,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:44,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2021-03-26 10:05:44,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:44,374 INFO L129 PetriNetUnfolder]: 23/86 cut-off events. [2021-03-26 10:05:44,374 INFO L130 PetriNetUnfolder]: For 106/112 co-relation queries the response was YES. [2021-03-26 10:05:44,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 86 events. 23/86 cut-off events. For 106/112 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 327 event pairs, 9 based on Foata normal form. 9/92 useless extension candidates. Maximal degree in co-relation 182. Up to 50 conditions per place. [2021-03-26 10:05:44,375 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 3 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-03-26 10:05:44,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 94 flow [2021-03-26 10:05:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:05:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:05:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-26 10:05:44,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2021-03-26 10:05:44,378 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-26 10:05:44,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-26 10:05:44,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:44,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-26 10:05:44,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have 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:05:44,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:44,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:44,383 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 82 flow. Second operand 4 states and 642 transitions. [2021-03-26 10:05:44,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 94 flow [2021-03-26 10:05:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:05:44,384 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 91 flow [2021-03-26 10:05:44,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 10:05:44,385 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -15 predicate places. [2021-03-26 10:05:44,385 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:44,385 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 91 flow [2021-03-26 10:05:44,386 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 91 flow [2021-03-26 10:05:44,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 91 flow [2021-03-26 10:05:44,400 INFO L129 PetriNetUnfolder]: 23/86 cut-off events. [2021-03-26 10:05:44,400 INFO L130 PetriNetUnfolder]: For 67/68 co-relation queries the response was YES. [2021-03-26 10:05:44,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 86 events. 23/86 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 344 event pairs, 9 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 181. Up to 50 conditions per place. [2021-03-26 10:05:44,401 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-26 10:05:44,418 INFO L154 LiptonReduction]: Checked pairs total: 139 [2021-03-26 10:05:44,418 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:05:44,418 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 10:05:44,419 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 91 flow [2021-03-26 10:05:44,419 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:05:44,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:44,419 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:05:44,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:05:44,420 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash -714752683, now seen corresponding path program 2 times [2021-03-26 10:05:44,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:44,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17138932] [2021-03-26 10:05:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:44,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:44,477 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:05:44,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:05:44,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:44,484 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:05:44,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17138932] [2021-03-26 10:05:44,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:44,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:05:44,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599591124] [2021-03-26 10:05:44,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:05:44,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:05:44,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:05:44,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2021-03-26 10:05:44,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have 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:05:44,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:44,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2021-03-26 10:05:44,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:44,561 INFO L129 PetriNetUnfolder]: 111/279 cut-off events. [2021-03-26 10:05:44,561 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2021-03-26 10:05:44,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 279 events. 111/279 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1616 event pairs, 46 based on Foata normal form. 26/283 useless extension candidates. Maximal degree in co-relation 621. Up to 154 conditions per place. [2021-03-26 10:05:44,563 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 8 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-03-26 10:05:44,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 143 flow [2021-03-26 10:05:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:05:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:05:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 793 transitions. [2021-03-26 10:05:44,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391534391534392 [2021-03-26 10:05:44,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 793 transitions. [2021-03-26 10:05:44,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 793 transitions. [2021-03-26 10:05:44,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:44,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 793 transitions. [2021-03-26 10:05:44,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have 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:05:44,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have 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:05:44,571 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have 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:05:44,571 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 91 flow. Second operand 5 states and 793 transitions. [2021-03-26 10:05:44,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 143 flow [2021-03-26 10:05:44,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:05:44,575 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 150 flow [2021-03-26 10:05:44,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-26 10:05:44,575 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2021-03-26 10:05:44,575 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:44,575 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 150 flow [2021-03-26 10:05:44,576 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 150 flow [2021-03-26 10:05:44,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 150 flow [2021-03-26 10:05:44,617 INFO L129 PetriNetUnfolder]: 115/280 cut-off events. [2021-03-26 10:05:44,617 INFO L130 PetriNetUnfolder]: For 267/326 co-relation queries the response was YES. [2021-03-26 10:05:44,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 280 events. 115/280 cut-off events. For 267/326 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1604 event pairs, 49 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 794. Up to 161 conditions per place. [2021-03-26 10:05:44,620 INFO L142 LiptonReduction]: Number of co-enabled transitions 330 [2021-03-26 10:05:44,646 INFO L154 LiptonReduction]: Checked pairs total: 255 [2021-03-26 10:05:44,646 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:05:44,646 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-26 10:05:44,648 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 144 flow [2021-03-26 10:05:44,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have 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:05:44,649 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:44,649 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:05:44,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:05:44,649 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 956401554, now seen corresponding path program 1 times [2021-03-26 10:05:44,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:44,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016859651] [2021-03-26 10:05:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:44,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:44,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:44,762 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:05:44,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:05:44,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:44,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:44,771 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:05:44,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016859651] [2021-03-26 10:05:44,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:44,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:05:44,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342207661] [2021-03-26 10:05:44,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:05:44,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:05:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:05:44,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2021-03-26 10:05:44,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:05:44,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:44,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2021-03-26 10:05:44,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:44,843 INFO L129 PetriNetUnfolder]: 53/166 cut-off events. [2021-03-26 10:05:44,843 INFO L130 PetriNetUnfolder]: For 193/262 co-relation queries the response was YES. [2021-03-26 10:05:44,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 166 events. 53/166 cut-off events. For 193/262 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 792 event pairs, 8 based on Foata normal form. 47/208 useless extension candidates. Maximal degree in co-relation 556. Up to 105 conditions per place. [2021-03-26 10:05:44,845 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 5 selfloop transitions, 11 changer transitions 3/38 dead transitions. [2021-03-26 10:05:44,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 222 flow [2021-03-26 10:05:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:05:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:05:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 951 transitions. [2021-03-26 10:05:44,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8386243386243386 [2021-03-26 10:05:44,848 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 951 transitions. [2021-03-26 10:05:44,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 951 transitions. [2021-03-26 10:05:44,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:44,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 951 transitions. [2021-03-26 10:05:44,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have 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:05:44,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have 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:05:44,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have 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:05:44,854 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 144 flow. Second operand 6 states and 951 transitions. [2021-03-26 10:05:44,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 222 flow [2021-03-26 10:05:44,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:05:44,858 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 208 flow [2021-03-26 10:05:44,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-26 10:05:44,859 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2021-03-26 10:05:44,859 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:44,859 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 208 flow [2021-03-26 10:05:44,859 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 208 flow [2021-03-26 10:05:44,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 208 flow [2021-03-26 10:05:44,876 INFO L129 PetriNetUnfolder]: 50/161 cut-off events. [2021-03-26 10:05:44,876 INFO L130 PetriNetUnfolder]: For 397/500 co-relation queries the response was YES. [2021-03-26 10:05:44,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 161 events. 50/161 cut-off events. For 397/500 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 800 event pairs, 8 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 577. Up to 99 conditions per place. [2021-03-26 10:05:44,878 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-26 10:05:44,897 INFO L154 LiptonReduction]: Checked pairs total: 252 [2021-03-26 10:05:44,897 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:05:44,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 10:05:44,907 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 200 flow [2021-03-26 10:05:44,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:05:44,908 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:44,908 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:05:44,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:05:44,908 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 814892855, now seen corresponding path program 1 times [2021-03-26 10:05:44,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:44,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425830853] [2021-03-26 10:05:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:45,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:45,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:45,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:45,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:45,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:45,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:45,027 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:05:45,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:05:45,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:45,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:45,037 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:05:45,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425830853] [2021-03-26 10:05:45,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:45,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:05:45,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550949757] [2021-03-26 10:05:45,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:05:45,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:05:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:05:45,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2021-03-26 10:05:45,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 200 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:05:45,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:45,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2021-03-26 10:05:45,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:45,100 INFO L129 PetriNetUnfolder]: 28/98 cut-off events. [2021-03-26 10:05:45,101 INFO L130 PetriNetUnfolder]: For 224/265 co-relation queries the response was YES. [2021-03-26 10:05:45,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 98 events. 28/98 cut-off events. For 224/265 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 351 event pairs, 2 based on Foata normal form. 32/127 useless extension candidates. Maximal degree in co-relation 366. Up to 58 conditions per place. [2021-03-26 10:05:45,102 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 2 selfloop transitions, 11 changer transitions 4/35 dead transitions. [2021-03-26 10:05:45,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 35 transitions, 232 flow [2021-03-26 10:05:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:05:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:05:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1103 transitions. [2021-03-26 10:05:45,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8337112622826909 [2021-03-26 10:05:45,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1103 transitions. [2021-03-26 10:05:45,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1103 transitions. [2021-03-26 10:05:45,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:45,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1103 transitions. [2021-03-26 10:05:45,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.57142857142858) internal successors, (1103), 7 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have 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:05:45,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:45,110 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:45,110 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 200 flow. Second operand 7 states and 1103 transitions. [2021-03-26 10:05:45,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 35 transitions, 232 flow [2021-03-26 10:05:45,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 202 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-03-26 10:05:45,112 INFO L241 Difference]: Finished difference. Result has 49 places, 31 transitions, 176 flow [2021-03-26 10:05:45,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2021-03-26 10:05:45,112 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 10:05:45,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:45,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 31 transitions, 176 flow [2021-03-26 10:05:45,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 31 transitions, 176 flow [2021-03-26 10:05:45,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 31 transitions, 176 flow [2021-03-26 10:05:45,120 INFO L129 PetriNetUnfolder]: 14/62 cut-off events. [2021-03-26 10:05:45,120 INFO L130 PetriNetUnfolder]: For 85/90 co-relation queries the response was YES. [2021-03-26 10:05:45,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 62 events. 14/62 cut-off events. For 85/90 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 1 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 196. Up to 20 conditions per place. [2021-03-26 10:05:45,121 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-26 10:05:45,497 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:05:45,648 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:05:46,357 WARN L205 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2021-03-26 10:05:46,584 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 10:05:48,012 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 350 DAG size of output: 278 [2021-03-26 10:05:48,625 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-26 10:05:48,634 INFO L154 LiptonReduction]: Checked pairs total: 224 [2021-03-26 10:05:48,634 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:05:48,635 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3522 [2021-03-26 10:05:48,635 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 160 flow [2021-03-26 10:05:48,636 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:05:48,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:48,636 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:05:48,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:05:48,636 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:48,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1706566609, now seen corresponding path program 1 times [2021-03-26 10:05:48,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:48,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292596943] [2021-03-26 10:05:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:05:48,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:48,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:05:48,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:48,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:48,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:05:48,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:05:48,690 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:05:48,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292596943] [2021-03-26 10:05:48,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:05:48,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:05:48,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142277127] [2021-03-26 10:05:48,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:05:48,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:05:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:05:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:05:48,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 192 [2021-03-26 10:05:48,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:05:48,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:05:48,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 192 [2021-03-26 10:05:48,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:05:48,733 INFO L129 PetriNetUnfolder]: 28/97 cut-off events. [2021-03-26 10:05:48,733 INFO L130 PetriNetUnfolder]: For 178/187 co-relation queries the response was YES. [2021-03-26 10:05:48,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 97 events. 28/97 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 2 based on Foata normal form. 7/100 useless extension candidates. Maximal degree in co-relation 305. Up to 31 conditions per place. [2021-03-26 10:05:48,734 INFO L132 encePairwiseOnDemand]: 189/192 looper letters, 3 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2021-03-26 10:05:48,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 28 transitions, 174 flow [2021-03-26 10:05:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:05:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:05:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-26 10:05:48,736 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8619791666666666 [2021-03-26 10:05:48,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-26 10:05:48,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-26 10:05:48,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:05:48,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-26 10:05:48,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:05:48,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have 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:05:48,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have 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:05:48,740 INFO L185 Difference]: Start difference. First operand has 43 places, 27 transitions, 160 flow. Second operand 4 states and 662 transitions. [2021-03-26 10:05:48,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 28 transitions, 174 flow [2021-03-26 10:05:48,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 130 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-03-26 10:05:48,742 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 123 flow [2021-03-26 10:05:48,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2021-03-26 10:05:48,743 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2021-03-26 10:05:48,743 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:05:48,743 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 123 flow [2021-03-26 10:05:48,743 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 123 flow [2021-03-26 10:05:48,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 123 flow [2021-03-26 10:05:48,752 INFO L129 PetriNetUnfolder]: 16/65 cut-off events. [2021-03-26 10:05:48,752 INFO L130 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2021-03-26 10:05:48,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 65 events. 16/65 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 182 event pairs, 1 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 154. Up to 20 conditions per place. [2021-03-26 10:05:48,753 INFO L142 LiptonReduction]: Number of co-enabled transitions 154 [2021-03-26 10:05:48,818 INFO L154 LiptonReduction]: Checked pairs total: 53 [2021-03-26 10:05:48,819 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:05:48,819 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 10:05:48,819 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 121 flow [2021-03-26 10:05:48,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:05:48,821 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:05:48,821 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:05:48,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:05:48,821 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:05:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:05:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1879254776, now seen corresponding path program 1 times [2021-03-26 10:05:48,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:05:48,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739170568] [2021-03-26 10:05:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:05:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:05:48,865 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:05:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:05:48,915 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:05:48,964 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:05:48,965 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:05:48,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:05:49,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:05:49 BasicIcfg [2021-03-26 10:05:49,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:05:49,062 INFO L168 Benchmark]: Toolchain (without parser) took 22258.44 ms. Allocated memory was 255.9 MB in the beginning and 639.6 MB in the end (delta: 383.8 MB). Free memory was 234.5 MB in the beginning and 455.8 MB in the end (delta: -221.3 MB). Peak memory consumption was 161.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:05:49,062 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:05:49,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.23 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 233.9 MB in the beginning and 309.1 MB in the end (delta: -75.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:05:49,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.55 ms. Allocated memory is still 348.1 MB. Free memory was 309.1 MB in the beginning and 306.3 MB in the end (delta: 2.8 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:05:49,063 INFO L168 Benchmark]: Boogie Preprocessor took 28.51 ms. Allocated memory is still 348.1 MB. Free memory was 306.3 MB in the beginning and 303.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:05:49,063 INFO L168 Benchmark]: RCFGBuilder took 2056.06 ms. Allocated memory is still 348.1 MB. Free memory was 303.6 MB in the beginning and 204.1 MB in the end (delta: 99.5 MB). Peak memory consumption was 104.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:05:49,064 INFO L168 Benchmark]: TraceAbstraction took 19579.13 ms. Allocated memory was 348.1 MB in the beginning and 639.6 MB in the end (delta: 291.5 MB). Free memory was 203.1 MB in the beginning and 455.8 MB in the end (delta: -252.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:05:49,065 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 543.23 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 233.9 MB in the beginning and 309.1 MB in the end (delta: -75.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.55 ms. Allocated memory is still 348.1 MB. Free memory was 309.1 MB in the beginning and 306.3 MB in the end (delta: 2.8 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.51 ms. Allocated memory is still 348.1 MB. Free memory was 306.3 MB in the beginning and 303.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2056.06 ms. Allocated memory is still 348.1 MB. Free memory was 303.6 MB in the beginning and 204.1 MB in the end (delta: 99.5 MB). Peak memory consumption was 104.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19579.13 ms. Allocated memory was 348.1 MB in the beginning and 639.6 MB in the end (delta: 291.5 MB). Free memory was 203.1 MB in the beginning and 455.8 MB in the end (delta: -252.7 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8260.4ms, 111 PlacesBefore, 52 PlacesAfterwards, 103 TransitionsBefore, 43 TransitionsAfterwards, 2042 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 3464 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1526, positive: 1434, positive conditional: 1434, positive unconditional: 0, negative: 92, negative conditional: 92, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1526, positive: 1434, positive conditional: 0, positive unconditional: 1434, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1526, positive: 1434, positive conditional: 0, positive unconditional: 1434, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1203, positive: 1166, positive conditional: 0, positive unconditional: 1166, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1203, positive: 1162, positive conditional: 0, positive unconditional: 1162, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 687, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 674, negative conditional: 0, negative unconditional: 674, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1526, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 1203, unknown conditional: 0, unknown unconditional: 1203] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1166, Positive conditional cache size: 0, Positive unconditional cache size: 1166, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3860.1ms, 49 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 25 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1266 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, positive: 153, positive conditional: 153, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, positive: 153, positive conditional: 17, positive unconditional: 136, negative: 83, negative conditional: 6, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, positive: 153, positive conditional: 17, positive unconditional: 136, negative: 83, negative conditional: 6, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 62, positive conditional: 6, positive unconditional: 56, negative: 14, negative conditional: 2, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 14, negative conditional: 2, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 269, negative conditional: 42, negative unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 236, positive: 91, positive conditional: 11, positive unconditional: 80, negative: 69, negative conditional: 4, negative unconditional: 65, unknown: 76, unknown conditional: 8, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 1279, Positive cache size: 1228, Positive conditional cache size: 6, Positive unconditional cache size: 1222, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1446.5ms, 35 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 771 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 102, positive conditional: 102, 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: 162, positive: 102, positive conditional: 0, positive unconditional: 102, 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: 162, positive: 102, positive conditional: 0, positive unconditional: 102, 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: 20, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 20, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1245, Positive conditional cache size: 6, Positive unconditional cache size: 1239, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5ms, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1253, Positive conditional cache size: 6, Positive unconditional cache size: 1247, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 126.7ms, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 189 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 43, positive conditional: 43, 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: 56, positive: 43, positive conditional: 8, positive unconditional: 35, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 43, positive conditional: 8, positive unconditional: 35, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 1, positive unconditional: 7, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 84, negative conditional: 33, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 35, positive conditional: 7, positive unconditional: 28, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1261, Positive conditional cache size: 7, Positive unconditional cache size: 1254, Negative cache size: 58, Negative conditional cache size: 4, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 139 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, positive: 36, positive conditional: 9, positive unconditional: 27, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 36, positive conditional: 9, positive unconditional: 27, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 25, positive conditional: 6, positive unconditional: 19, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1331, Positive cache size: 1272, Positive conditional cache size: 10, Positive unconditional cache size: 1262, Negative cache size: 59, Negative conditional cache size: 4, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.3ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 71, positive conditional: 71, 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: 83, positive: 71, positive conditional: 41, positive unconditional: 30, 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: 83, positive: 71, positive conditional: 41, positive unconditional: 30, 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: 5, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 68, positive conditional: 40, positive unconditional: 28, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1275, Positive conditional cache size: 11, Positive unconditional cache size: 1264, Negative cache size: 61, Negative conditional cache size: 4, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 252 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 58, positive conditional: 58, 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: 70, positive: 58, positive conditional: 42, positive unconditional: 16, 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: 70, positive: 58, positive conditional: 42, positive unconditional: 16, 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: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 54, positive conditional: 38, positive unconditional: 16, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1279, Positive conditional cache size: 15, Positive unconditional cache size: 1264, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3521.5ms, 49 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 224 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 48, positive conditional: 48, 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: 62, positive: 48, positive conditional: 29, positive unconditional: 19, 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: 62, positive: 48, positive conditional: 29, positive unconditional: 19, 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: 10, positive: 8, positive conditional: 4, positive unconditional: 4, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, positive: 40, positive conditional: 25, positive unconditional: 15, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1351, Positive cache size: 1287, Positive conditional cache size: 19, Positive unconditional cache size: 1268, Negative cache size: 64, Negative conditional cache size: 4, Negative unconditional cache size: 60, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.7ms, 40 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 53 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, positive: 16, positive conditional: 7, positive unconditional: 9, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 16, positive conditional: 7, positive unconditional: 9, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 1, positive unconditional: 6, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 20, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 9, unknown conditional: 2, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1294, Positive conditional cache size: 20, Positive unconditional cache size: 1274, Negative cache size: 66, Negative conditional cache size: 5, Negative unconditional cache size: 61, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19392.7ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 681.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8329.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 13 SDslu, 13 SDs, 0 SdLazy, 121 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 162.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 108.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=7, InterpolantAutomatonStates: 38, 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: 31.2ms SsaConstructionTime, 330.0ms SatisfiabilityAnalysisTime, 544.1ms InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...