/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/safe032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:42:04,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:42:04,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:42:04,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:42:04,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:42:04,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:42:04,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:42:04,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:42:04,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:42:04,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:42:04,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:42:04,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:42:04,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:42:04,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:42:04,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:42:04,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:42:04,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:42:04,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:42:04,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:42:04,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:42:04,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:42:04,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:42:04,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:42:04,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:42:04,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:42:04,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:42:04,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:42:04,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:42:04,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:42:04,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:42:04,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:42:04,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:42:04,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:42:04,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:42:04,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:42:04,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:42:04,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:42:04,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:42:04,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:42:04,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:42:04,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:42:04,358 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:42:04,395 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:42:04,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:42:04,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:42:04,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:42:04,399 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:42:04,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:42:04,399 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:42:04,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:42:04,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:42:04,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:42:04,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:42:04,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:42:04,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:42:04,401 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:42:04,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:42:04,401 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:42:04,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:42:04,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:42:04,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:42:04,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:42:04,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:42:04,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:42:04,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:42:04,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:42:04,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:42:04,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:42:04,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:42:04,403 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:42:04,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:42:04,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:42:04,404 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:42:04,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:42:04,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:42:04,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:42:04,724 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:42:04,725 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:42:04,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-03-26 10:42:04,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba0c2e47/3b94dfe9715f459fa6dfed868a296553/FLAG672d29354 [2021-03-26 10:42:05,349 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:42:05,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-03-26 10:42:05,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba0c2e47/3b94dfe9715f459fa6dfed868a296553/FLAG672d29354 [2021-03-26 10:42:05,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba0c2e47/3b94dfe9715f459fa6dfed868a296553 [2021-03-26 10:42:05,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:42:05,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:42:05,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:42:05,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:42:05,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:42:05,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:42:05" (1/1) ... [2021-03-26 10:42:05,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e119908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:05, skipping insertion in model container [2021-03-26 10:42:05,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:42:05" (1/1) ... [2021-03-26 10:42:05,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:42:05,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:42:06,020 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/safe032_pso.oepc.i[993,1006] [2021-03-26 10:42:06,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:42:06,268 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:42:06,279 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/safe032_pso.oepc.i[993,1006] [2021-03-26 10:42:06,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:42:06,430 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:42:06,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06 WrapperNode [2021-03-26 10:42:06,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:42:06,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:42:06,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:42:06,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:42:06,440 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:42:06" (1/1) ... [2021-03-26 10:42:06,473 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:42:06" (1/1) ... [2021-03-26 10:42:06,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:42:06,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:42:06,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:42:06,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:42:06,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:42:06,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:42:06,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:42:06,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:42:06,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (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:42:06,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:42:06,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:42:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:42:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:42:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:42:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:42:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:42:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:42:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:42:06,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:42:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:42:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:42:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:42:06,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:42:06,663 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:42:09,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:42:09,453 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:42:09,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:42:09 BoogieIcfgContainer [2021-03-26 10:42:09,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:42:09,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:42:09,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:42:09,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:42:09,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:42:05" (1/3) ... [2021-03-26 10:42:09,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487a83c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:42:09, skipping insertion in model container [2021-03-26 10:42:09,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (2/3) ... [2021-03-26 10:42:09,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487a83c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:42:09, skipping insertion in model container [2021-03-26 10:42:09,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:42:09" (3/3) ... [2021-03-26 10:42:09,463 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.oepc.i [2021-03-26 10:42:09,468 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:42:09,472 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:42:09,473 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:42:09,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,568 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,568 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,568 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,582 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:09,600 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:42:09,615 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:42:09,642 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:42:09,642 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:42:09,642 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:42:09,642 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:42:09,642 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:42:09,642 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:42:09,642 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:42:09,642 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:42:09,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:42:09,692 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:42:09,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:09,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:42:09,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:42:09,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:09,711 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:09,721 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:09,724 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:09,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:09,756 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:42:09,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:09,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:42:09,764 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-26 10:42:10,776 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:42:11,186 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:42:11,300 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:42:12,952 WARN L205 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:42:13,263 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:42:14,603 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:42:15,186 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:42:16,012 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-26 10:42:16,012 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-26 10:42:16,015 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6305 [2021-03-26 10:42:16,025 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:42:16,025 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:16,026 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:16,026 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:42:16,026 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-26 10:42:16,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:16,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158742108] [2021-03-26 10:42:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:16,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:16,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:16,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:16,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:16,280 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:42:16,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158742108] [2021-03-26 10:42:16,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:16,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:16,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430135546] [2021-03-26 10:42:16,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:16,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:16,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:16,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:16,300 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 10:42:16,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:42:16,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:16,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 10:42:16,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:16,456 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-26 10:42:16,456 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:16,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-26 10:42:16,461 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-26 10:42:16,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-26 10:42:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-26 10:42:16,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-26 10:42:16,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-26 10:42:16,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-26 10:42:16,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:16,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-26 10:42:16,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:42:16,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:42:16,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:42:16,500 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-26 10:42:16,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-26 10:42:16,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:16,504 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:16,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 10:42:16,506 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:42:16,507 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:16,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:16,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:16,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:16,514 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:42:16,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:16,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:42:16,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 10:42:17,018 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:42:17,340 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:42:18,601 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-26 10:42:19,204 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:42:19,838 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:42:19,970 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:42:20,553 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 202 [2021-03-26 10:42:20,852 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 10:42:21,720 WARN L205 SmtUtils]: Spent 860.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 10:42:22,573 WARN L205 SmtUtils]: Spent 852.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 10:42:22,936 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-26 10:42:22,936 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:42:22,937 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6430 [2021-03-26 10:42:22,938 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:42:22,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:42:22,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:22,938 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:42:22,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:42:22,939 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-26 10:42:22,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:22,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810474460] [2021-03-26 10:42:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:23,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:23,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:23,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:23,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:23,067 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:42:23,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:42:23,071 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:42:23,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810474460] [2021-03-26 10:42:23,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:23,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:23,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218084804] [2021-03-26 10:42:23,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:23,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:23,074 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 174 [2021-03-26 10:42:23,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:42:23,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:23,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 174 [2021-03-26 10:42:23,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:23,113 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-03-26 10:42:23,113 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:23,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2021-03-26 10:42:23,114 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 1 selfloop transitions, 2 changer transitions 3/26 dead transitions. [2021-03-26 10:42:23,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 74 flow [2021-03-26 10:42:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2021-03-26 10:42:23,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8701149425287357 [2021-03-26 10:42:23,118 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 757 transitions. [2021-03-26 10:42:23,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 757 transitions. [2021-03-26 10:42:23,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:23,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 757 transitions. [2021-03-26 10:42:23,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have 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:42:23,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have 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:42:23,121 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have 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:42:23,121 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 757 transitions. [2021-03-26 10:42:23,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 74 flow [2021-03-26 10:42:23,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:23,122 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 60 flow [2021-03-26 10:42:23,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-03-26 10:42:23,123 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places. [2021-03-26 10:42:23,123 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:23,123 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 60 flow [2021-03-26 10:42:23,124 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 60 flow [2021-03-26 10:42:23,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 10:42:23,128 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:42:23,128 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:42:23,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:42:23,128 INFO L142 LiptonReduction]: Number of co-enabled transitions 204 [2021-03-26 10:42:23,722 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:42:23,862 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:42:24,166 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:42:24,294 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:42:24,297 INFO L154 LiptonReduction]: Checked pairs total: 738 [2021-03-26 10:42:24,297 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:24,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1174 [2021-03-26 10:42:24,298 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:42:24,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:42:24,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:24,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:24,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:42:24,299 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1131497842, now seen corresponding path program 1 times [2021-03-26 10:42:24,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:24,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248618680] [2021-03-26 10:42:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:24,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:24,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:24,429 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:42:24,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248618680] [2021-03-26 10:42:24,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:24,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:24,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268154361] [2021-03-26 10:42:24,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:24,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:24,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:24,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:24,431 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 176 [2021-03-26 10:42:24,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:24,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 176 [2021-03-26 10:42:24,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:24,445 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:42:24,445 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 10:42:24,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:42:24,446 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-26 10:42:24,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:42:24,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8712121212121212 [2021-03-26 10:42:24,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:42:24,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:42:24,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:24,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:42:24,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have 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:42:24,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have 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:42:24,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have 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:42:24,452 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:42:24,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:24,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:24,453 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:24,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-26 10:42:24,453 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -15 predicate places. [2021-03-26 10:42:24,453 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:24,453 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:24,453 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:24,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:24,458 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:42:24,459 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:42:24,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 10:42:24,459 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 10:42:24,699 INFO L154 LiptonReduction]: Checked pairs total: 220 [2021-03-26 10:42:24,699 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:24,699 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 246 [2021-03-26 10:42:24,700 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:24,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:24,701 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:24,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:42:24,701 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1371931757, now seen corresponding path program 1 times [2021-03-26 10:42:24,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:24,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719973942] [2021-03-26 10:42:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:24,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:24,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:24,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:24,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:42:24,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:24,909 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:42:24,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719973942] [2021-03-26 10:42:24,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:24,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:24,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186542337] [2021-03-26 10:42:24,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:24,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:24,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 176 [2021-03-26 10:42:24,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have 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:42:24,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:24,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 176 [2021-03-26 10:42:24,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:25,165 INFO L129 PetriNetUnfolder]: 192/394 cut-off events. [2021-03-26 10:42:25,165 INFO L130 PetriNetUnfolder]: For 96/97 co-relation queries the response was YES. [2021-03-26 10:42:25,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 394 events. 192/394 cut-off events. For 96/97 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2103 event pairs, 4 based on Foata normal form. 22/405 useless extension candidates. Maximal degree in co-relation 804. Up to 202 conditions per place. [2021-03-26 10:42:25,169 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 21 selfloop transitions, 19 changer transitions 0/53 dead transitions. [2021-03-26 10:42:25,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 218 flow [2021-03-26 10:42:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1060 transitions. [2021-03-26 10:42:25,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7528409090909091 [2021-03-26 10:42:25,174 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1060 transitions. [2021-03-26 10:42:25,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1060 transitions. [2021-03-26 10:42:25,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:25,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1060 transitions. [2021-03-26 10:42:25,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.5) internal successors, (1060), 8 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have 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:42:25,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,180 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,180 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 8 states and 1060 transitions. [2021-03-26 10:42:25,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 218 flow [2021-03-26 10:42:25,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:25,183 INFO L241 Difference]: Finished difference. Result has 44 places, 40 transitions, 199 flow [2021-03-26 10:42:25,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=199, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2021-03-26 10:42:25,183 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:42:25,183 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:25,184 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 40 transitions, 199 flow [2021-03-26 10:42:25,184 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 40 transitions, 199 flow [2021-03-26 10:42:25,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 199 flow [2021-03-26 10:42:25,213 INFO L129 PetriNetUnfolder]: 53/177 cut-off events. [2021-03-26 10:42:25,214 INFO L130 PetriNetUnfolder]: For 330/359 co-relation queries the response was YES. [2021-03-26 10:42:25,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 177 events. 53/177 cut-off events. For 330/359 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1005 event pairs, 10 based on Foata normal form. 4/175 useless extension candidates. Maximal degree in co-relation 493. Up to 66 conditions per place. [2021-03-26 10:42:25,216 INFO L142 LiptonReduction]: Number of co-enabled transitions 384 [2021-03-26 10:42:25,306 INFO L154 LiptonReduction]: Checked pairs total: 228 [2021-03-26 10:42:25,306 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:25,307 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-26 10:42:25,307 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 199 flow [2021-03-26 10:42:25,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have 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:42:25,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:25,308 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:25,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:42:25,308 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1399577745, now seen corresponding path program 1 times [2021-03-26 10:42:25,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:25,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531618764] [2021-03-26 10:42:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:25,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:25,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:25,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:25,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:42:25,503 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-26 10:42:25,505 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-26 10:42:25,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:25,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:25,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:25,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:25,551 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:42:25,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531618764] [2021-03-26 10:42:25,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:25,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:25,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105763886] [2021-03-26 10:42:25,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:25,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:25,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 176 [2021-03-26 10:42:25,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have 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:42:25,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:25,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 176 [2021-03-26 10:42:25,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:25,891 INFO L129 PetriNetUnfolder]: 232/495 cut-off events. [2021-03-26 10:42:25,891 INFO L130 PetriNetUnfolder]: For 709/734 co-relation queries the response was YES. [2021-03-26 10:42:25,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 495 events. 232/495 cut-off events. For 709/734 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2931 event pairs, 5 based on Foata normal form. 29/509 useless extension candidates. Maximal degree in co-relation 1560. Up to 228 conditions per place. [2021-03-26 10:42:25,895 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 22 selfloop transitions, 12 changer transitions 23/70 dead transitions. [2021-03-26 10:42:25,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 460 flow [2021-03-26 10:42:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2021-03-26 10:42:25,899 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7237215909090909 [2021-03-26 10:42:25,899 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2021-03-26 10:42:25,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2021-03-26 10:42:25,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:25,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2021-03-26 10:42:25,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have 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:42:25,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,905 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,905 INFO L185 Difference]: Start difference. First operand has 44 places, 40 transitions, 199 flow. Second operand 8 states and 1019 transitions. [2021-03-26 10:42:25,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 460 flow [2021-03-26 10:42:25,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:42:25,912 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 279 flow [2021-03-26 10:42:25,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=279, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-26 10:42:25,913 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2021-03-26 10:42:25,913 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:25,913 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 279 flow [2021-03-26 10:42:25,913 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 279 flow [2021-03-26 10:42:25,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 279 flow [2021-03-26 10:42:25,965 INFO L129 PetriNetUnfolder]: 147/327 cut-off events. [2021-03-26 10:42:25,965 INFO L130 PetriNetUnfolder]: For 691/716 co-relation queries the response was YES. [2021-03-26 10:42:25,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 327 events. 147/327 cut-off events. For 691/716 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1768 event pairs, 25 based on Foata normal form. 6/306 useless extension candidates. Maximal degree in co-relation 1168. Up to 131 conditions per place. [2021-03-26 10:42:25,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-26 10:42:25,986 INFO L154 LiptonReduction]: Checked pairs total: 140 [2021-03-26 10:42:25,986 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:25,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-26 10:42:25,990 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 279 flow [2021-03-26 10:42:25,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have 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:42:25,991 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:25,991 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:25,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:42:25,991 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 76142003, now seen corresponding path program 1 times [2021-03-26 10:42:25,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:25,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768895389] [2021-03-26 10:42:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:26,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:26,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:26,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:26,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:26,121 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:42:26,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768895389] [2021-03-26 10:42:26,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:26,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:26,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879118154] [2021-03-26 10:42:26,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:26,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:26,124 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 10:42:26,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have 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:42:26,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:26,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 10:42:26,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:26,323 INFO L129 PetriNetUnfolder]: 186/392 cut-off events. [2021-03-26 10:42:26,324 INFO L130 PetriNetUnfolder]: For 1271/1333 co-relation queries the response was YES. [2021-03-26 10:42:26,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 392 events. 186/392 cut-off events. For 1271/1333 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2144 event pairs, 10 based on Foata normal form. 33/411 useless extension candidates. Maximal degree in co-relation 1626. Up to 223 conditions per place. [2021-03-26 10:42:26,328 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 24 selfloop transitions, 24 changer transitions 0/61 dead transitions. [2021-03-26 10:42:26,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 500 flow [2021-03-26 10:42:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2021-03-26 10:42:26,331 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7357954545454546 [2021-03-26 10:42:26,331 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2021-03-26 10:42:26,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2021-03-26 10:42:26,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:26,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2021-03-26 10:42:26,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have 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:42:26,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:42:26,335 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:42:26,335 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 279 flow. Second operand 6 states and 777 transitions. [2021-03-26 10:42:26,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 500 flow [2021-03-26 10:42:26,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 479 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 10:42:26,341 INFO L241 Difference]: Finished difference. Result has 56 places, 56 transitions, 469 flow [2021-03-26 10:42:26,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2021-03-26 10:42:26,342 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2021-03-26 10:42:26,342 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:26,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 469 flow [2021-03-26 10:42:26,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 469 flow [2021-03-26 10:42:26,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 469 flow [2021-03-26 10:42:26,397 INFO L129 PetriNetUnfolder]: 173/363 cut-off events. [2021-03-26 10:42:26,397 INFO L130 PetriNetUnfolder]: For 1163/1253 co-relation queries the response was YES. [2021-03-26 10:42:26,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 363 events. 173/363 cut-off events. For 1163/1253 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1923 event pairs, 31 based on Foata normal form. 32/378 useless extension candidates. Maximal degree in co-relation 1475. Up to 179 conditions per place. [2021-03-26 10:42:26,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-26 10:42:26,435 INFO L154 LiptonReduction]: Checked pairs total: 231 [2021-03-26 10:42:26,435 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:26,435 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93 [2021-03-26 10:42:26,437 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 469 flow [2021-03-26 10:42:26,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have 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:42:26,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:26,438 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:26,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:42:26,438 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash -843686623, now seen corresponding path program 1 times [2021-03-26 10:42:26,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:26,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121661682] [2021-03-26 10:42:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:26,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:42:26,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:26,604 INFO L142 QuantifierPusher]: treesize reduction 21, result has 73.4 percent of original size [2021-03-26 10:42:26,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-03-26 10:42:26,661 INFO L142 QuantifierPusher]: treesize reduction 21, result has 72.4 percent of original size [2021-03-26 10:42:26,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-26 10:42:26,720 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.8 percent of original size [2021-03-26 10:42:26,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:42:26,761 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.4 percent of original size [2021-03-26 10:42:26,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:42:26,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:26,817 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:42:26,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121661682] [2021-03-26 10:42:26,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:26,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:42:26,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420663136] [2021-03-26 10:42:26,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:42:26,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:42:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:42:26,820 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 176 [2021-03-26 10:42:26,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 469 flow. Second operand has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have 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:42:26,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:26,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 176 [2021-03-26 10:42:26,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:27,123 INFO L129 PetriNetUnfolder]: 200/422 cut-off events. [2021-03-26 10:42:27,124 INFO L130 PetriNetUnfolder]: For 1498/1596 co-relation queries the response was YES. [2021-03-26 10:42:27,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 422 events. 200/422 cut-off events. For 1498/1596 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2316 event pairs, 5 based on Foata normal form. 48/451 useless extension candidates. Maximal degree in co-relation 1984. Up to 226 conditions per place. [2021-03-26 10:42:27,129 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 26 selfloop transitions, 29 changer transitions 0/68 dead transitions. [2021-03-26 10:42:27,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 678 flow [2021-03-26 10:42:27,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2021-03-26 10:42:27,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7102272727272727 [2021-03-26 10:42:27,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2021-03-26 10:42:27,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2021-03-26 10:42:27,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:27,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2021-03-26 10:42:27,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have 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:42:27,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:42:27,137 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:42:27,137 INFO L185 Difference]: Start difference. First operand has 56 places, 56 transitions, 469 flow. Second operand 6 states and 750 transitions. [2021-03-26 10:42:27,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 678 flow [2021-03-26 10:42:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 663 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:27,145 INFO L241 Difference]: Finished difference. Result has 62 places, 62 transitions, 617 flow [2021-03-26 10:42:27,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2021-03-26 10:42:27,145 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2021-03-26 10:42:27,145 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:27,145 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 62 transitions, 617 flow [2021-03-26 10:42:27,146 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 62 transitions, 617 flow [2021-03-26 10:42:27,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 617 flow [2021-03-26 10:42:27,246 INFO L129 PetriNetUnfolder]: 187/384 cut-off events. [2021-03-26 10:42:27,246 INFO L130 PetriNetUnfolder]: For 1865/1927 co-relation queries the response was YES. [2021-03-26 10:42:27,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 384 events. 187/384 cut-off events. For 1865/1927 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2074 event pairs, 35 based on Foata normal form. 22/375 useless extension candidates. Maximal degree in co-relation 1835. Up to 196 conditions per place. [2021-03-26 10:42:27,252 INFO L142 LiptonReduction]: Number of co-enabled transitions 460 [2021-03-26 10:42:27,291 INFO L154 LiptonReduction]: Checked pairs total: 385 [2021-03-26 10:42:27,292 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:27,292 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-03-26 10:42:27,292 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 617 flow [2021-03-26 10:42:27,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have 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:42:27,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:27,293 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:27,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:42:27,293 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 158424233, now seen corresponding path program 1 times [2021-03-26 10:42:27,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:27,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356965316] [2021-03-26 10:42:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:27,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:27,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:27,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:27,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:27,417 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:42:27,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356965316] [2021-03-26 10:42:27,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:27,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:27,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203787909] [2021-03-26 10:42:27,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:27,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:27,419 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 176 [2021-03-26 10:42:27,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have 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:42:27,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:27,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 176 [2021-03-26 10:42:27,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:27,624 INFO L129 PetriNetUnfolder]: 204/459 cut-off events. [2021-03-26 10:42:27,624 INFO L130 PetriNetUnfolder]: For 2159/2241 co-relation queries the response was YES. [2021-03-26 10:42:27,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 459 events. 204/459 cut-off events. For 2159/2241 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2723 event pairs, 3 based on Foata normal form. 55/499 useless extension candidates. Maximal degree in co-relation 2348. Up to 241 conditions per place. [2021-03-26 10:42:27,630 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 35 selfloop transitions, 26 changer transitions 0/74 dead transitions. [2021-03-26 10:42:27,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 838 flow [2021-03-26 10:42:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2021-03-26 10:42:27,632 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7310606060606061 [2021-03-26 10:42:27,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2021-03-26 10:42:27,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2021-03-26 10:42:27,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:27,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2021-03-26 10:42:27,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have 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:42:27,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:42:27,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:42:27,638 INFO L185 Difference]: Start difference. First operand has 62 places, 62 transitions, 617 flow. Second operand 6 states and 772 transitions. [2021-03-26 10:42:27,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 838 flow [2021-03-26 10:42:27,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 818 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:27,649 INFO L241 Difference]: Finished difference. Result has 67 places, 69 transitions, 775 flow [2021-03-26 10:42:27,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2021-03-26 10:42:27,649 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2021-03-26 10:42:27,649 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:27,649 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 69 transitions, 775 flow [2021-03-26 10:42:27,649 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 69 transitions, 775 flow [2021-03-26 10:42:27,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 69 transitions, 775 flow [2021-03-26 10:42:27,713 INFO L129 PetriNetUnfolder]: 183/420 cut-off events. [2021-03-26 10:42:27,713 INFO L130 PetriNetUnfolder]: For 2494/2575 co-relation queries the response was YES. [2021-03-26 10:42:27,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 420 events. 183/420 cut-off events. For 2494/2575 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2467 event pairs, 39 based on Foata normal form. 30/423 useless extension candidates. Maximal degree in co-relation 2121. Up to 186 conditions per place. [2021-03-26 10:42:27,720 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-26 10:42:27,762 INFO L154 LiptonReduction]: Checked pairs total: 589 [2021-03-26 10:42:27,762 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:27,762 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-03-26 10:42:27,762 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 775 flow [2021-03-26 10:42:27,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have 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:42:27,763 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:27,763 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:27,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:42:27,763 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1934585665, now seen corresponding path program 2 times [2021-03-26 10:42:27,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:27,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624292690] [2021-03-26 10:42:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:27,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:27,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:27,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:27,888 INFO L142 QuantifierPusher]: treesize reduction 37, result has 53.8 percent of original size [2021-03-26 10:42:27,889 INFO L147 QuantifierPusher]: treesize reduction 11, result has 74.4 percent of original size 32 [2021-03-26 10:42:27,898 INFO L142 QuantifierPusher]: treesize reduction 21, result has 70.0 percent of original size [2021-03-26 10:42:27,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 10:42:27,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:27,939 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:42:27,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624292690] [2021-03-26 10:42:27,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:27,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:27,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030607765] [2021-03-26 10:42:27,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:27,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:27,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:27,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 176 [2021-03-26 10:42:27,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 775 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have 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:42:27,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:27,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 176 [2021-03-26 10:42:27,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:28,102 INFO L129 PetriNetUnfolder]: 199/465 cut-off events. [2021-03-26 10:42:28,102 INFO L130 PetriNetUnfolder]: For 2656/2720 co-relation queries the response was YES. [2021-03-26 10:42:28,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 465 events. 199/465 cut-off events. For 2656/2720 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2832 event pairs, 23 based on Foata normal form. 40/490 useless extension candidates. Maximal degree in co-relation 2561. Up to 256 conditions per place. [2021-03-26 10:42:28,108 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 42 selfloop transitions, 23 changer transitions 4/82 dead transitions. [2021-03-26 10:42:28,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 1063 flow [2021-03-26 10:42:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:42:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:42:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2021-03-26 10:42:28,111 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7571022727272727 [2021-03-26 10:42:28,111 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2021-03-26 10:42:28,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2021-03-26 10:42:28,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:28,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2021-03-26 10:42:28,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have 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:42:28,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:28,114 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:28,114 INFO L185 Difference]: Start difference. First operand has 67 places, 69 transitions, 775 flow. Second operand 4 states and 533 transitions. [2021-03-26 10:42:28,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 1063 flow [2021-03-26 10:42:28,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 1047 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:28,122 INFO L241 Difference]: Finished difference. Result has 68 places, 74 transitions, 907 flow [2021-03-26 10:42:28,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=907, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2021-03-26 10:42:28,123 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2021-03-26 10:42:28,123 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:28,123 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 74 transitions, 907 flow [2021-03-26 10:42:28,123 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 74 transitions, 907 flow [2021-03-26 10:42:28,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 74 transitions, 907 flow [2021-03-26 10:42:28,187 INFO L129 PetriNetUnfolder]: 171/411 cut-off events. [2021-03-26 10:42:28,188 INFO L130 PetriNetUnfolder]: For 2872/2975 co-relation queries the response was YES. [2021-03-26 10:42:28,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 411 events. 171/411 cut-off events. For 2872/2975 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2437 event pairs, 37 based on Foata normal form. 46/438 useless extension candidates. Maximal degree in co-relation 2239. Up to 174 conditions per place. [2021-03-26 10:42:28,195 INFO L142 LiptonReduction]: Number of co-enabled transitions 534 [2021-03-26 10:42:28,223 INFO L154 LiptonReduction]: Checked pairs total: 772 [2021-03-26 10:42:28,223 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:28,223 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 100 [2021-03-26 10:42:28,224 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 907 flow [2021-03-26 10:42:28,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have 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:42:28,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:28,225 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:28,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:42:28,225 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash 975106455, now seen corresponding path program 1 times [2021-03-26 10:42:28,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:28,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829269981] [2021-03-26 10:42:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:28,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:28,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:28,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:28,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:28,275 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:42:28,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829269981] [2021-03-26 10:42:28,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:28,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:28,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140115386] [2021-03-26 10:42:28,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:28,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:28,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:28,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:28,277 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 176 [2021-03-26 10:42:28,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:42:28,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:28,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 176 [2021-03-26 10:42:28,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:28,429 INFO L129 PetriNetUnfolder]: 208/542 cut-off events. [2021-03-26 10:42:28,429 INFO L130 PetriNetUnfolder]: For 3759/3935 co-relation queries the response was YES. [2021-03-26 10:42:28,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 542 events. 208/542 cut-off events. For 3759/3935 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3705 event pairs, 49 based on Foata normal form. 59/582 useless extension candidates. Maximal degree in co-relation 2953. Up to 238 conditions per place. [2021-03-26 10:42:28,434 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 3 selfloop transitions, 3 changer transitions 8/74 dead transitions. [2021-03-26 10:42:28,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 919 flow [2021-03-26 10:42:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 10:42:28,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8693181818181818 [2021-03-26 10:42:28,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 10:42:28,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 10:42:28,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:28,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 10:42:28,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:42:28,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have 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:42:28,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have 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:42:28,439 INFO L185 Difference]: Start difference. First operand has 68 places, 74 transitions, 907 flow. Second operand 3 states and 459 transitions. [2021-03-26 10:42:28,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 919 flow [2021-03-26 10:42:28,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 74 transitions, 891 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:28,448 INFO L241 Difference]: Finished difference. Result has 68 places, 66 transitions, 789 flow [2021-03-26 10:42:28,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2021-03-26 10:42:28,449 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2021-03-26 10:42:28,449 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:28,449 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 66 transitions, 789 flow [2021-03-26 10:42:28,449 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 66 transitions, 789 flow [2021-03-26 10:42:28,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 789 flow [2021-03-26 10:42:28,520 INFO L129 PetriNetUnfolder]: 176/472 cut-off events. [2021-03-26 10:42:28,520 INFO L130 PetriNetUnfolder]: For 2885/3032 co-relation queries the response was YES. [2021-03-26 10:42:28,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2498 conditions, 472 events. 176/472 cut-off events. For 2885/3032 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3154 event pairs, 26 based on Foata normal form. 43/492 useless extension candidates. Maximal degree in co-relation 2467. Up to 215 conditions per place. [2021-03-26 10:42:28,528 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 10:42:28,759 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:42:29,212 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2021-03-26 10:42:29,367 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 10:42:29,441 INFO L154 LiptonReduction]: Checked pairs total: 736 [2021-03-26 10:42:29,441 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:29,441 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 992 [2021-03-26 10:42:29,441 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 794 flow [2021-03-26 10:42:29,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:42:29,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:29,442 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:42:29,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:42:29,442 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash 953895351, now seen corresponding path program 1 times [2021-03-26 10:42:29,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:29,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919527911] [2021-03-26 10:42:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:29,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:29,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:29,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:29,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:29,547 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-26 10:42:29,549 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-26 10:42:29,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:29,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:42:29,597 INFO L142 QuantifierPusher]: treesize reduction 5, result has 86.5 percent of original size [2021-03-26 10:42:29,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:42:29,624 INFO L142 QuantifierPusher]: treesize reduction 25, result has 46.8 percent of original size [2021-03-26 10:42:29,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:29,643 INFO L142 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-03-26 10:42:29,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:42:29,654 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:42:29,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919527911] [2021-03-26 10:42:29,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:29,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:42:29,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19818135] [2021-03-26 10:42:29,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:42:29,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:42:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:42:29,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 177 [2021-03-26 10:42:29,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have 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:42:29,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:29,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 177 [2021-03-26 10:42:29,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:30,017 INFO L129 PetriNetUnfolder]: 200/519 cut-off events. [2021-03-26 10:42:30,017 INFO L130 PetriNetUnfolder]: For 3486/3651 co-relation queries the response was YES. [2021-03-26 10:42:30,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 519 events. 200/519 cut-off events. For 3486/3651 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3487 event pairs, 35 based on Foata normal form. 40/540 useless extension candidates. Maximal degree in co-relation 3007. Up to 345 conditions per place. [2021-03-26 10:42:30,021 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 46 selfloop transitions, 12 changer transitions 5/76 dead transitions. [2021-03-26 10:42:30,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 1019 flow [2021-03-26 10:42:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 956 transitions. [2021-03-26 10:42:30,025 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6751412429378532 [2021-03-26 10:42:30,025 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 956 transitions. [2021-03-26 10:42:30,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 956 transitions. [2021-03-26 10:42:30,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:30,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 956 transitions. [2021-03-26 10:42:30,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.5) internal successors, (956), 8 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have 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:42:30,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have 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:42:30,030 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have 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:42:30,030 INFO L185 Difference]: Start difference. First operand has 67 places, 66 transitions, 794 flow. Second operand 8 states and 956 transitions. [2021-03-26 10:42:30,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 1019 flow [2021-03-26 10:42:30,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 965 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-03-26 10:42:30,037 INFO L241 Difference]: Finished difference. Result has 69 places, 66 transitions, 770 flow [2021-03-26 10:42:30,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=770, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2021-03-26 10:42:30,038 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2021-03-26 10:42:30,038 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:30,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 66 transitions, 770 flow [2021-03-26 10:42:30,038 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 66 transitions, 770 flow [2021-03-26 10:42:30,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 770 flow [2021-03-26 10:42:30,156 INFO L129 PetriNetUnfolder]: 172/468 cut-off events. [2021-03-26 10:42:30,156 INFO L130 PetriNetUnfolder]: For 2435/2502 co-relation queries the response was YES. [2021-03-26 10:42:30,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 468 events. 172/468 cut-off events. For 2435/2502 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3160 event pairs, 33 based on Foata normal form. 32/475 useless extension candidates. Maximal degree in co-relation 2449. Up to 211 conditions per place. [2021-03-26 10:42:30,163 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 10:42:30,202 INFO L154 LiptonReduction]: Checked pairs total: 387 [2021-03-26 10:42:30,202 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:30,202 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 164 [2021-03-26 10:42:30,202 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 770 flow [2021-03-26 10:42:30,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have 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:42:30,203 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:30,203 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:30,203 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:42:30,203 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -262240032, now seen corresponding path program 1 times [2021-03-26 10:42:30,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:30,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768996700] [2021-03-26 10:42:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:30,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:30,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:42:30,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:42:30,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:42:30,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:30,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:42:30,360 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:42:30,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768996700] [2021-03-26 10:42:30,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:30,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:42:30,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581973457] [2021-03-26 10:42:30,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:42:30,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:42:30,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:42:30,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2021-03-26 10:42:30,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 770 flow. Second operand has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have 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:42:30,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:30,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2021-03-26 10:42:30,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:30,742 INFO L129 PetriNetUnfolder]: 212/573 cut-off events. [2021-03-26 10:42:30,742 INFO L130 PetriNetUnfolder]: For 3041/3191 co-relation queries the response was YES. [2021-03-26 10:42:30,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 573 events. 212/573 cut-off events. For 3041/3191 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4091 event pairs, 0 based on Foata normal form. 84/644 useless extension candidates. Maximal degree in co-relation 3252. Up to 272 conditions per place. [2021-03-26 10:42:30,747 INFO L132 encePairwiseOnDemand]: 167/177 looper letters, 32 selfloop transitions, 33 changer transitions 11/89 dead transitions. [2021-03-26 10:42:30,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 1178 flow [2021-03-26 10:42:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 10:42:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 10:42:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1254 transitions. [2021-03-26 10:42:30,751 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7084745762711865 [2021-03-26 10:42:30,751 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1254 transitions. [2021-03-26 10:42:30,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1254 transitions. [2021-03-26 10:42:30,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:30,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1254 transitions. [2021-03-26 10:42:30,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.4) internal successors, (1254), 10 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have 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:42:30,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have 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:42:30,758 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have 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:42:30,758 INFO L185 Difference]: Start difference. First operand has 67 places, 66 transitions, 770 flow. Second operand 10 states and 1254 transitions. [2021-03-26 10:42:30,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 1178 flow [2021-03-26 10:42:30,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 1146 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 10:42:30,769 INFO L241 Difference]: Finished difference. Result has 76 places, 69 transitions, 910 flow [2021-03-26 10:42:30,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=910, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2021-03-26 10:42:30,769 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2021-03-26 10:42:30,769 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:30,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 910 flow [2021-03-26 10:42:30,769 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 910 flow [2021-03-26 10:42:30,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 910 flow [2021-03-26 10:42:30,831 INFO L129 PetriNetUnfolder]: 146/412 cut-off events. [2021-03-26 10:42:30,831 INFO L130 PetriNetUnfolder]: For 3124/3237 co-relation queries the response was YES. [2021-03-26 10:42:30,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2365 conditions, 412 events. 146/412 cut-off events. For 3124/3237 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2715 event pairs, 43 based on Foata normal form. 44/434 useless extension candidates. Maximal degree in co-relation 2333. Up to 182 conditions per place. [2021-03-26 10:42:30,837 INFO L142 LiptonReduction]: Number of co-enabled transitions 430 [2021-03-26 10:42:30,864 INFO L154 LiptonReduction]: Checked pairs total: 370 [2021-03-26 10:42:30,865 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:30,865 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 96 [2021-03-26 10:42:30,866 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 910 flow [2021-03-26 10:42:30,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have 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:42:30,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:30,866 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:30,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:42:30,867 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1827084925, now seen corresponding path program 1 times [2021-03-26 10:42:30,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:30,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593280419] [2021-03-26 10:42:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:30,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:30,928 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:30,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:30,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:30,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593280419] [2021-03-26 10:42:30,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:30,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:30,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659579466] [2021-03-26 10:42:30,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:30,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:30,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 177 [2021-03-26 10:42:30,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 910 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:42:30,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:30,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 177 [2021-03-26 10:42:30,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:31,073 INFO L129 PetriNetUnfolder]: 369/850 cut-off events. [2021-03-26 10:42:31,073 INFO L130 PetriNetUnfolder]: For 3878/4141 co-relation queries the response was YES. [2021-03-26 10:42:31,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 850 events. 369/850 cut-off events. For 3878/4141 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 6101 event pairs, 140 based on Foata normal form. 230/1013 useless extension candidates. Maximal degree in co-relation 3242. Up to 492 conditions per place. [2021-03-26 10:42:31,080 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 9 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2021-03-26 10:42:31,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 843 flow [2021-03-26 10:42:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 10:42:31,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564971751412429 [2021-03-26 10:42:31,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 10:42:31,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 10:42:31,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:31,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 10:42:31,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have 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:42:31,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have 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:42:31,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have 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:42:31,086 INFO L185 Difference]: Start difference. First operand has 76 places, 69 transitions, 910 flow. Second operand 5 states and 758 transitions. [2021-03-26 10:42:31,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 843 flow [2021-03-26 10:42:31,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 799 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 10:42:31,098 INFO L241 Difference]: Finished difference. Result has 76 places, 69 transitions, 809 flow [2021-03-26 10:42:31,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2021-03-26 10:42:31,099 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2021-03-26 10:42:31,099 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:31,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 809 flow [2021-03-26 10:42:31,099 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 809 flow [2021-03-26 10:42:31,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 809 flow [2021-03-26 10:42:31,199 INFO L129 PetriNetUnfolder]: 377/863 cut-off events. [2021-03-26 10:42:31,200 INFO L130 PetriNetUnfolder]: For 4203/4446 co-relation queries the response was YES. [2021-03-26 10:42:31,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3836 conditions, 863 events. 377/863 cut-off events. For 4203/4446 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 6206 event pairs, 135 based on Foata normal form. 70/853 useless extension candidates. Maximal degree in co-relation 3802. Up to 492 conditions per place. [2021-03-26 10:42:31,211 INFO L142 LiptonReduction]: Number of co-enabled transitions 538 [2021-03-26 10:42:32,303 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 10:42:32,711 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 10:42:35,033 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 377 DAG size of output: 315 [2021-03-26 10:42:36,037 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 306 [2021-03-26 10:42:36,050 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 10:42:36,050 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:36,050 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4951 [2021-03-26 10:42:36,050 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 818 flow [2021-03-26 10:42:36,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:42:36,051 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:36,051 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:42:36,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:42:36,051 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1382396215, now seen corresponding path program 1 times [2021-03-26 10:42:36,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:36,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527887767] [2021-03-26 10:42:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:36,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:36,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:36,116 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:36,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:36,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:36,126 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:42:36,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527887767] [2021-03-26 10:42:36,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:36,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:36,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161963695] [2021-03-26 10:42:36,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:36,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:36,128 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 178 [2021-03-26 10:42:36,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 818 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:36,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 178 [2021-03-26 10:42:36,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:36,263 INFO L129 PetriNetUnfolder]: 218/635 cut-off events. [2021-03-26 10:42:36,264 INFO L130 PetriNetUnfolder]: For 3919/5034 co-relation queries the response was YES. [2021-03-26 10:42:36,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 635 events. 218/635 cut-off events. For 3919/5034 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4832 event pairs, 18 based on Foata normal form. 497/1096 useless extension candidates. Maximal degree in co-relation 3022. Up to 396 conditions per place. [2021-03-26 10:42:36,269 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 5 selfloop transitions, 15 changer transitions 3/77 dead transitions. [2021-03-26 10:42:36,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 902 flow [2021-03-26 10:42:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1068 transitions. [2021-03-26 10:42:36,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-26 10:42:36,272 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1068 transitions. [2021-03-26 10:42:36,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1068 transitions. [2021-03-26 10:42:36,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:36,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1068 transitions. [2021-03-26 10:42:36,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.57142857142858) internal successors, (1068), 7 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have 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:42:36,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have 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:42:36,277 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have 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:42:36,278 INFO L185 Difference]: Start difference. First operand has 76 places, 69 transitions, 818 flow. Second operand 7 states and 1068 transitions. [2021-03-26 10:42:36,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 902 flow [2021-03-26 10:42:36,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 861 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:36,288 INFO L241 Difference]: Finished difference. Result has 83 places, 74 transitions, 856 flow [2021-03-26 10:42:36,288 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=856, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2021-03-26 10:42:36,289 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2021-03-26 10:42:36,289 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:36,289 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 74 transitions, 856 flow [2021-03-26 10:42:36,289 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 74 transitions, 856 flow [2021-03-26 10:42:36,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 74 transitions, 856 flow [2021-03-26 10:42:36,354 INFO L129 PetriNetUnfolder]: 194/599 cut-off events. [2021-03-26 10:42:36,354 INFO L130 PetriNetUnfolder]: For 3953/4577 co-relation queries the response was YES. [2021-03-26 10:42:36,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 599 events. 194/599 cut-off events. For 3953/4577 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4622 event pairs, 18 based on Foata normal form. 49/607 useless extension candidates. Maximal degree in co-relation 3060. Up to 360 conditions per place. [2021-03-26 10:42:36,362 INFO L142 LiptonReduction]: Number of co-enabled transitions 582 [2021-03-26 10:42:36,394 INFO L154 LiptonReduction]: Checked pairs total: 74 [2021-03-26 10:42:36,394 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:36,394 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 105 [2021-03-26 10:42:36,395 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 840 flow [2021-03-26 10:42:36,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,395 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:36,395 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:42:36,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:42:36,396 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1730395816, now seen corresponding path program 1 times [2021-03-26 10:42:36,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:36,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077289539] [2021-03-26 10:42:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:36,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:36,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:36,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:36,482 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:36,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:36,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:36,495 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:42:36,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077289539] [2021-03-26 10:42:36,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:36,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:36,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735877316] [2021-03-26 10:42:36,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:36,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:36,498 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 178 [2021-03-26 10:42:36,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 840 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have 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:42:36,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:36,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 178 [2021-03-26 10:42:36,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:36,598 INFO L129 PetriNetUnfolder]: 94/311 cut-off events. [2021-03-26 10:42:36,598 INFO L130 PetriNetUnfolder]: For 2289/2458 co-relation queries the response was YES. [2021-03-26 10:42:36,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 311 events. 94/311 cut-off events. For 2289/2458 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1884 event pairs, 0 based on Foata normal form. 108/409 useless extension candidates. Maximal degree in co-relation 1764. Up to 176 conditions per place. [2021-03-26 10:42:36,601 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 2 selfloop transitions, 11 changer transitions 4/70 dead transitions. [2021-03-26 10:42:36,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 70 transitions, 845 flow [2021-03-26 10:42:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-03-26 10:42:36,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515248796147673 [2021-03-26 10:42:36,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-03-26 10:42:36,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-03-26 10:42:36,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:36,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-03-26 10:42:36,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have 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:42:36,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have 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:42:36,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have 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:42:36,622 INFO L185 Difference]: Start difference. First operand has 83 places, 72 transitions, 840 flow. Second operand 7 states and 1061 transitions. [2021-03-26 10:42:36,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 70 transitions, 845 flow [2021-03-26 10:42:36,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 70 transitions, 789 flow, removed 20 selfloop flow, removed 6 redundant places. [2021-03-26 10:42:36,631 INFO L241 Difference]: Finished difference. Result has 81 places, 66 transitions, 762 flow [2021-03-26 10:42:36,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=762, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2021-03-26 10:42:36,631 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2021-03-26 10:42:36,631 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:36,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 66 transitions, 762 flow [2021-03-26 10:42:36,632 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 66 transitions, 762 flow [2021-03-26 10:42:36,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 66 transitions, 762 flow [2021-03-26 10:42:36,667 INFO L129 PetriNetUnfolder]: 80/291 cut-off events. [2021-03-26 10:42:36,668 INFO L130 PetriNetUnfolder]: For 1421/1467 co-relation queries the response was YES. [2021-03-26 10:42:36,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 291 events. 80/291 cut-off events. For 1421/1467 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1823 event pairs, 2 based on Foata normal form. 11/292 useless extension candidates. Maximal degree in co-relation 1539. Up to 98 conditions per place. [2021-03-26 10:42:36,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 10:42:37,390 WARN L205 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 10:42:37,640 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:42:39,117 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 338 DAG size of output: 262 [2021-03-26 10:42:39,665 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:42:39,918 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:42:40,163 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:42:40,700 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:42:41,258 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:42:41,263 INFO L154 LiptonReduction]: Checked pairs total: 11 [2021-03-26 10:42:41,263 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:42:41,263 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4632 [2021-03-26 10:42:41,264 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 748 flow [2021-03-26 10:42:41,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have 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:42:41,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:41,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:41,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:42:41,265 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1202302751, now seen corresponding path program 1 times [2021-03-26 10:42:41,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:41,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821680098] [2021-03-26 10:42:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:41,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:41,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:41,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:41,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:41,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:42:41,414 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:42:41,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821680098] [2021-03-26 10:42:41,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:41,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:41,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007396458] [2021-03-26 10:42:41,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:41,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:41,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 180 [2021-03-26 10:42:41,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 748 flow. Second operand has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:42:41,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:41,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 180 [2021-03-26 10:42:41,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:41,717 INFO L129 PetriNetUnfolder]: 111/334 cut-off events. [2021-03-26 10:42:41,718 INFO L130 PetriNetUnfolder]: For 2036/2152 co-relation queries the response was YES. [2021-03-26 10:42:41,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 334 events. 111/334 cut-off events. For 2036/2152 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2137 event pairs, 0 based on Foata normal form. 40/356 useless extension candidates. Maximal degree in co-relation 1934. Up to 113 conditions per place. [2021-03-26 10:42:41,720 INFO L132 encePairwiseOnDemand]: 170/180 looper letters, 23 selfloop transitions, 26 changer transitions 13/78 dead transitions. [2021-03-26 10:42:41,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 1061 flow [2021-03-26 10:42:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:42:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:42:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1095 transitions. [2021-03-26 10:42:41,725 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2021-03-26 10:42:41,726 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1095 transitions. [2021-03-26 10:42:41,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1095 transitions. [2021-03-26 10:42:41,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:41,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1095 transitions. [2021-03-26 10:42:41,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:42:41,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have 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:42:41,732 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have 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:42:41,732 INFO L185 Difference]: Start difference. First operand has 77 places, 63 transitions, 748 flow. Second operand 9 states and 1095 transitions. [2021-03-26 10:42:41,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 1061 flow [2021-03-26 10:42:41,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 78 transitions, 987 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-03-26 10:42:41,742 INFO L241 Difference]: Finished difference. Result has 80 places, 64 transitions, 815 flow [2021-03-26 10:42:41,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=815, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2021-03-26 10:42:41,742 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2021-03-26 10:42:41,742 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:41,742 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 64 transitions, 815 flow [2021-03-26 10:42:41,743 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 64 transitions, 815 flow [2021-03-26 10:42:41,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 64 transitions, 815 flow [2021-03-26 10:42:41,763 INFO L129 PetriNetUnfolder]: 44/151 cut-off events. [2021-03-26 10:42:41,763 INFO L130 PetriNetUnfolder]: For 951/969 co-relation queries the response was YES. [2021-03-26 10:42:41,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 151 events. 44/151 cut-off events. For 951/969 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 698 event pairs, 1 based on Foata normal form. 9/157 useless extension candidates. Maximal degree in co-relation 757. Up to 44 conditions per place. [2021-03-26 10:42:41,765 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-26 10:42:42,546 WARN L205 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:42:42,877 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:42:44,547 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:42:45,280 WARN L205 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:42:45,955 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:42:46,270 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:42:47,777 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:42:48,524 WARN L205 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:42:49,412 WARN L205 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:42:49,824 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:42:51,449 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:42:52,128 WARN L205 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:42:52,855 WARN L205 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:42:53,182 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:42:54,699 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:42:55,457 WARN L205 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:42:56,404 WARN L205 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:42:56,758 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:42:58,408 WARN L205 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:42:59,146 WARN L205 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:42:59,941 WARN L205 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:43:00,308 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:43:02,121 WARN L205 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:43:02,945 WARN L205 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:43:03,688 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 10:43:04,042 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 10:43:04,266 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 10:43:04,623 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 10:43:04,688 INFO L154 LiptonReduction]: Checked pairs total: 203 [2021-03-26 10:43:04,688 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:43:04,689 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22947 [2021-03-26 10:43:04,689 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 833 flow [2021-03-26 10:43:04,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:43:04,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:04,690 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:43:04,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:43:04,690 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1425408314, now seen corresponding path program 1 times [2021-03-26 10:43:04,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:04,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585787468] [2021-03-26 10:43:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:04,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:04,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:43:04,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:04,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:43:04,782 INFO L142 QuantifierPusher]: treesize reduction 16, result has 84.9 percent of original size [2021-03-26 10:43:04,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-03-26 10:43:04,820 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-26 10:43:04,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 10:43:04,862 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 10:43:04,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 10:43:04,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:04,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:43:04,916 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:43:04,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585787468] [2021-03-26 10:43:04,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:04,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:43:04,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331036431] [2021-03-26 10:43:04,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:43:04,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:43:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:43:04,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 192 [2021-03-26 10:43:04,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 833 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:43:04,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:04,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 192 [2021-03-26 10:43:04,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:05,239 INFO L129 PetriNetUnfolder]: 50/161 cut-off events. [2021-03-26 10:43:05,240 INFO L130 PetriNetUnfolder]: For 1220/1244 co-relation queries the response was YES. [2021-03-26 10:43:05,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 161 events. 50/161 cut-off events. For 1220/1244 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 785 event pairs, 0 based on Foata normal form. 11/168 useless extension candidates. Maximal degree in co-relation 894. Up to 49 conditions per place. [2021-03-26 10:43:05,241 INFO L132 encePairwiseOnDemand]: 173/192 looper letters, 13 selfloop transitions, 21 changer transitions 22/70 dead transitions. [2021-03-26 10:43:05,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 70 transitions, 1060 flow [2021-03-26 10:43:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:43:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:43:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2021-03-26 10:43:05,255 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2021-03-26 10:43:05,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2021-03-26 10:43:05,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2021-03-26 10:43:05,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:05,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2021-03-26 10:43:05,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have 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:43:05,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:43:05,259 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:43:05,259 INFO L185 Difference]: Start difference. First operand has 78 places, 62 transitions, 833 flow. Second operand 7 states and 872 transitions. [2021-03-26 10:43:05,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 70 transitions, 1060 flow [2021-03-26 10:43:05,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 968 flow, removed 20 selfloop flow, removed 7 redundant places. [2021-03-26 10:43:05,266 INFO L241 Difference]: Finished difference. Result has 78 places, 46 transitions, 591 flow [2021-03-26 10:43:05,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=78, PETRI_TRANSITIONS=46} [2021-03-26 10:43:05,266 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2021-03-26 10:43:05,266 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:05,266 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 46 transitions, 591 flow [2021-03-26 10:43:05,266 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 46 transitions, 591 flow [2021-03-26 10:43:05,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 46 transitions, 591 flow [2021-03-26 10:43:05,281 INFO L129 PetriNetUnfolder]: 27/99 cut-off events. [2021-03-26 10:43:05,281 INFO L130 PetriNetUnfolder]: For 618/623 co-relation queries the response was YES. [2021-03-26 10:43:05,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 99 events. 27/99 cut-off events. For 618/623 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 400 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 507. Up to 30 conditions per place. [2021-03-26 10:43:05,282 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 10:43:05,283 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:43:05,283 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:43:05,284 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 10:43:05,284 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 591 flow [2021-03-26 10:43:05,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:43:05,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:05,285 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:43:05,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:43:05,285 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1338181826, now seen corresponding path program 1 times [2021-03-26 10:43:05,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:05,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309568007] [2021-03-26 10:43:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:05,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:05,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:43:05,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:05,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:05,375 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:43:05,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:43:05,405 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-26 10:43:05,408 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-26 10:43:05,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:05,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:43:05,457 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:43:05,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309568007] [2021-03-26 10:43:05,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:05,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:43:05,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722765093] [2021-03-26 10:43:05,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:43:05,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:43:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:43:05,460 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 192 [2021-03-26 10:43:05,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 46 transitions, 591 flow. Second operand has 7 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have 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:43:05,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:05,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 192 [2021-03-26 10:43:05,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:05,617 INFO L129 PetriNetUnfolder]: 31/111 cut-off events. [2021-03-26 10:43:05,617 INFO L130 PetriNetUnfolder]: For 725/735 co-relation queries the response was YES. [2021-03-26 10:43:05,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 111 events. 31/111 cut-off events. For 725/735 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 479 event pairs, 0 based on Foata normal form. 8/116 useless extension candidates. Maximal degree in co-relation 585. Up to 36 conditions per place. [2021-03-26 10:43:05,619 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 23 selfloop transitions, 2 changer transitions 9/48 dead transitions. [2021-03-26 10:43:05,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 48 transitions, 677 flow [2021-03-26 10:43:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:43:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:43:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2021-03-26 10:43:05,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6588541666666666 [2021-03-26 10:43:05,623 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2021-03-26 10:43:05,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2021-03-26 10:43:05,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:05,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2021-03-26 10:43:05,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have 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:43:05,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have 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:43:05,626 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have 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:43:05,626 INFO L185 Difference]: Start difference. First operand has 74 places, 46 transitions, 591 flow. Second operand 6 states and 759 transitions. [2021-03-26 10:43:05,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 48 transitions, 677 flow [2021-03-26 10:43:05,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 48 transitions, 585 flow, removed 25 selfloop flow, removed 10 redundant places. [2021-03-26 10:43:05,631 INFO L241 Difference]: Finished difference. Result has 70 places, 39 transitions, 416 flow [2021-03-26 10:43:05,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=70, PETRI_TRANSITIONS=39} [2021-03-26 10:43:05,631 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2021-03-26 10:43:05,632 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:05,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 39 transitions, 416 flow [2021-03-26 10:43:05,632 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 39 transitions, 416 flow [2021-03-26 10:43:05,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 39 transitions, 416 flow [2021-03-26 10:43:05,644 INFO L129 PetriNetUnfolder]: 24/87 cut-off events. [2021-03-26 10:43:05,645 INFO L130 PetriNetUnfolder]: For 369/372 co-relation queries the response was YES. [2021-03-26 10:43:05,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 87 events. 24/87 cut-off events. For 369/372 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 334 event pairs, 0 based on Foata normal form. 2/87 useless extension candidates. Maximal degree in co-relation 389. Up to 26 conditions per place. [2021-03-26 10:43:05,646 INFO L142 LiptonReduction]: Number of co-enabled transitions 72 [2021-03-26 10:43:06,604 WARN L205 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-26 10:43:06,894 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:43:08,883 WARN L205 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 377 DAG size of output: 239 [2021-03-26 10:43:09,561 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2021-03-26 10:43:09,564 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:43:09,565 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:43:09,565 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3933 [2021-03-26 10:43:09,565 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 426 flow [2021-03-26 10:43:09,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have 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:43:09,566 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:09,566 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:43:09,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 10:43:09,566 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash 55085648, now seen corresponding path program 1 times [2021-03-26 10:43:09,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:09,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145158353] [2021-03-26 10:43:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:09,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:09,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:09,632 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:43:09,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:43:09,665 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 10:43:09,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 10:43:09,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:09,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:09,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:09,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:43:09,731 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:43:09,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145158353] [2021-03-26 10:43:09,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:09,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:43:09,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231295060] [2021-03-26 10:43:09,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:43:09,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:43:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:43:09,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 193 [2021-03-26 10:43:09,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 426 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:43:09,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:09,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 193 [2021-03-26 10:43:09,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:09,982 INFO L129 PetriNetUnfolder]: 28/99 cut-off events. [2021-03-26 10:43:09,982 INFO L130 PetriNetUnfolder]: For 467/474 co-relation queries the response was YES. [2021-03-26 10:43:09,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 99 events. 28/99 cut-off events. For 467/474 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 390 event pairs, 0 based on Foata normal form. 6/103 useless extension candidates. Maximal degree in co-relation 465. Up to 32 conditions per place. [2021-03-26 10:43:09,983 INFO L132 encePairwiseOnDemand]: 184/193 looper letters, 6 selfloop transitions, 5 changer transitions 17/42 dead transitions. [2021-03-26 10:43:09,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 42 transitions, 508 flow [2021-03-26 10:43:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:43:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:43:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2021-03-26 10:43:09,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6338514680483592 [2021-03-26 10:43:09,988 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2021-03-26 10:43:09,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2021-03-26 10:43:09,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:09,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2021-03-26 10:43:09,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have 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:43:09,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have 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:43:09,991 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have 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:43:09,991 INFO L185 Difference]: Start difference. First operand has 63 places, 39 transitions, 426 flow. Second operand 6 states and 734 transitions. [2021-03-26 10:43:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 42 transitions, 508 flow [2021-03-26 10:43:09,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 42 transitions, 455 flow, removed 17 selfloop flow, removed 10 redundant places. [2021-03-26 10:43:09,996 INFO L241 Difference]: Finished difference. Result has 59 places, 25 transitions, 202 flow [2021-03-26 10:43:09,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=59, PETRI_TRANSITIONS=25} [2021-03-26 10:43:09,996 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2021-03-26 10:43:09,997 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:09,997 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 25 transitions, 202 flow [2021-03-26 10:43:09,999 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 25 transitions, 202 flow [2021-03-26 10:43:10,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 25 transitions, 202 flow [2021-03-26 10:43:10,005 INFO L129 PetriNetUnfolder]: 7/31 cut-off events. [2021-03-26 10:43:10,005 INFO L130 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2021-03-26 10:43:10,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 31 events. 7/31 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 2/33 useless extension candidates. Maximal degree in co-relation 117. Up to 10 conditions per place. [2021-03-26 10:43:10,005 INFO L142 LiptonReduction]: Number of co-enabled transitions 26 [2021-03-26 10:43:11,094 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 271 DAG size of output: 160 [2021-03-26 10:43:11,356 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:43:13,537 WARN L205 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 377 DAG size of output: 243 [2021-03-26 10:43:14,264 WARN L205 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2021-03-26 10:43:15,183 WARN L205 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-03-26 10:43:15,605 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:43:16,602 WARN L205 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:43:17,648 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:43:18,737 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 213 DAG size of output: 156 [2021-03-26 10:43:19,078 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:43:21,599 WARN L205 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 316 DAG size of output: 257 [2021-03-26 10:43:22,605 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:43:22,998 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:43:23,414 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:43:24,322 WARN L205 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 230 [2021-03-26 10:43:25,266 WARN L205 SmtUtils]: Spent 942.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2021-03-26 10:43:25,269 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-26 10:43:25,270 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:43:25,270 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15274 [2021-03-26 10:43:25,270 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 24 transitions, 220 flow [2021-03-26 10:43:25,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:43:25,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:25,271 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:43:25,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 10:43:25,271 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1212398682, now seen corresponding path program 1 times [2021-03-26 10:43:25,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:25,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061111411] [2021-03-26 10:43:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:43:25,308 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:43:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:43:25,368 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:43:25,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:43:25,405 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:43:25,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 10:43:25,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:43:25 BasicIcfg [2021-03-26 10:43:25,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:43:25,469 INFO L168 Benchmark]: Toolchain (without parser) took 79660.59 ms. Allocated memory was 255.9 MB in the beginning and 866.1 MB in the end (delta: 610.3 MB). Free memory was 231.5 MB in the beginning and 808.0 MB in the end (delta: -576.5 MB). Peak memory consumption was 529.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:25,469 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:43:25,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.03 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 231.5 MB in the beginning and 345.7 MB in the end (delta: -114.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:25,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.46 ms. Allocated memory is still 390.1 MB. Free memory was 345.7 MB in the beginning and 342.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:25,469 INFO L168 Benchmark]: Boogie Preprocessor took 61.60 ms. Allocated memory is still 390.1 MB. Free memory was 342.9 MB in the beginning and 340.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:25,470 INFO L168 Benchmark]: RCFGBuilder took 2879.28 ms. Allocated memory was 390.1 MB in the beginning and 469.8 MB in the end (delta: 79.7 MB). Free memory was 339.4 MB in the beginning and 387.7 MB in the end (delta: -48.3 MB). Peak memory consumption was 132.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:25,470 INFO L168 Benchmark]: TraceAbstraction took 76010.50 ms. Allocated memory was 469.8 MB in the beginning and 866.1 MB in the end (delta: 396.4 MB). Free memory was 386.7 MB in the beginning and 808.0 MB in the end (delta: -421.3 MB). Peak memory consumption was 470.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:25,470 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.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 622.03 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 231.5 MB in the beginning and 345.7 MB in the end (delta: -114.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.46 ms. Allocated memory is still 390.1 MB. Free memory was 345.7 MB in the beginning and 342.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.60 ms. Allocated memory is still 390.1 MB. Free memory was 342.9 MB in the beginning and 340.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2879.28 ms. Allocated memory was 390.1 MB in the beginning and 469.8 MB in the end (delta: 79.7 MB). Free memory was 339.4 MB in the beginning and 387.7 MB in the end (delta: -48.3 MB). Peak memory consumption was 132.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 76010.50 ms. Allocated memory was 469.8 MB in the beginning and 866.1 MB in the end (delta: 396.4 MB). Free memory was 386.7 MB in the beginning and 808.0 MB in the end (delta: -421.3 MB). Peak memory consumption was 470.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6288.6ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 1353, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, 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: 1076, positive: 1035, positive conditional: 0, positive unconditional: 1035, 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: 908, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 875, negative conditional: 0, negative unconditional: 875, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, positive: 314, positive conditional: 0, positive unconditional: 314, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1076, unknown conditional: 0, unknown unconditional: 1076] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1039, Positive conditional cache size: 0, Positive unconditional cache size: 1039, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6428.3ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 361, 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: 444, positive: 361, positive conditional: 20, positive unconditional: 341, negative: 83, negative conditional: 4, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 20, positive unconditional: 341, negative: 83, negative conditional: 4, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, positive: 89, positive conditional: 3, positive unconditional: 86, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 116, negative conditional: 19, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 272, positive conditional: 17, positive unconditional: 255, negative: 75, negative conditional: 3, negative unconditional: 72, unknown: 97, unknown conditional: 4, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1128, Positive conditional cache size: 3, Positive unconditional cache size: 1125, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1173.6ms, 36 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 738 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, positive: 216, positive conditional: 216, 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: 276, positive: 216, positive conditional: 0, positive unconditional: 216, 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: 276, positive: 216, positive conditional: 0, positive unconditional: 216, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, positive: 212, positive conditional: 0, positive unconditional: 212, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1132, Positive conditional cache size: 3, Positive unconditional cache size: 1129, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 246.0ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 237, negative conditional: 0, negative unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1183, Positive cache size: 1132, Positive conditional cache size: 3, Positive unconditional cache size: 1129, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 228 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, positive: 118, positive conditional: 118, 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: 127, positive: 118, positive conditional: 50, positive unconditional: 68, 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: 127, positive: 118, positive conditional: 50, positive unconditional: 68, 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: 7, positive: 5, positive conditional: 2, positive unconditional: 3, 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: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, positive: 113, positive conditional: 48, positive unconditional: 65, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1137, Positive conditional cache size: 5, Positive unconditional cache size: 1132, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.0ms, 56 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 140 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, positive: 101, positive conditional: 43, positive unconditional: 58, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 101, positive conditional: 43, positive unconditional: 58, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, positive: 98, positive conditional: 41, positive unconditional: 57, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1140, Positive conditional cache size: 7, Positive unconditional cache size: 1133, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.0ms, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 231 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, positive: 179, positive conditional: 179, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, positive: 179, positive conditional: 89, positive unconditional: 90, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 179, positive conditional: 89, positive unconditional: 90, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, positive: 178, positive conditional: 88, positive unconditional: 90, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1141, Positive conditional cache size: 8, Positive unconditional cache size: 1133, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.0ms, 62 PlacesBefore, 62 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 385 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, positive: 306, positive conditional: 306, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, positive: 306, positive conditional: 161, positive unconditional: 145, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, positive: 306, positive conditional: 161, positive unconditional: 145, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, positive: 305, positive conditional: 160, positive unconditional: 145, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1195, Positive cache size: 1142, Positive conditional cache size: 9, Positive unconditional cache size: 1133, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 112.4ms, 67 PlacesBefore, 67 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 589 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 516, positive: 497, positive conditional: 497, 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: 516, positive: 497, positive conditional: 293, positive unconditional: 204, 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: 516, positive: 497, positive conditional: 293, positive unconditional: 204, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 516, positive: 497, positive conditional: 293, positive unconditional: 204, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1195, Positive cache size: 1142, Positive conditional cache size: 9, Positive unconditional cache size: 1133, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.0ms, 68 PlacesBefore, 68 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 772 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 696, positive: 674, positive conditional: 674, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 696, positive: 674, positive conditional: 425, positive unconditional: 249, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 696, positive: 674, positive conditional: 425, positive unconditional: 249, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 696, positive: 673, positive conditional: 424, positive unconditional: 249, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1143, Positive conditional cache size: 10, Positive unconditional cache size: 1133, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 53 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 991.8ms, 68 PlacesBefore, 67 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 736 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 593, positive: 559, positive conditional: 559, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 593, positive: 559, positive conditional: 263, positive unconditional: 296, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 593, positive: 559, positive conditional: 263, positive unconditional: 296, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 593, positive: 555, positive conditional: 261, positive unconditional: 294, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1147, Positive conditional cache size: 12, Positive unconditional cache size: 1135, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 84 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 163.5ms, 69 PlacesBefore, 67 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 387 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, positive: 285, positive conditional: 285, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303, positive: 285, positive conditional: 141, positive unconditional: 144, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303, positive: 285, positive conditional: 141, positive unconditional: 144, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, positive: 283, positive conditional: 139, positive unconditional: 144, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1202, Positive cache size: 1149, Positive conditional cache size: 14, Positive unconditional cache size: 1135, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 95.3ms, 76 PlacesBefore, 76 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 370 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 293, positive: 275, positive conditional: 275, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 293, positive: 275, positive conditional: 145, positive unconditional: 130, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 293, positive: 275, positive conditional: 145, positive unconditional: 130, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 293, positive: 274, positive conditional: 144, positive unconditional: 130, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1150, Positive conditional cache size: 15, Positive unconditional cache size: 1135, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4950.7ms, 76 PlacesBefore, 76 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1151, Positive conditional cache size: 16, Positive unconditional cache size: 1135, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.3ms, 83 PlacesBefore, 83 PlacesAfterwards, 74 TransitionsBefore, 72 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 74, positive conditional: 68, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 74, positive conditional: 68, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 20, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 74, positive: 52, positive conditional: 48, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 22, unknown conditional: 20, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1173, Positive conditional cache size: 36, Positive unconditional cache size: 1137, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4631.2ms, 81 PlacesBefore, 77 PlacesAfterwards, 66 TransitionsBefore, 63 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 11 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1233, Positive cache size: 1180, Positive conditional cache size: 42, Positive unconditional cache size: 1138, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22945.9ms, 80 PlacesBefore, 78 PlacesAfterwards, 64 TransitionsBefore, 62 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 203 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, positive: 203, positive conditional: 203, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, positive: 203, positive conditional: 109, positive unconditional: 94, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, positive: 203, positive conditional: 109, positive unconditional: 94, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, positive: 198, positive conditional: 106, positive unconditional: 92, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1185, Positive conditional cache size: 45, Positive unconditional cache size: 1140, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 94 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0ms, 78 PlacesBefore, 74 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1185, Positive conditional cache size: 45, Positive unconditional cache size: 1140, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3932.7ms, 70 PlacesBefore, 63 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1185, Positive conditional cache size: 45, Positive unconditional cache size: 1140, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15270.3ms, 59 PlacesBefore, 54 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 4 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1185, Positive conditional cache size: 45, Positive unconditional cache size: 1140, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2543; [L850] FCALL, FORK 0 pthread_create(&t2543, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2544; [L852] FCALL, FORK 0 pthread_create(&t2544, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2545; [L854] FCALL, FORK 0 pthread_create(&t2545, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 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) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] 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) [L775] 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) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 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 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=57, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 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) [L827] 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) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 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 [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 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 [L798] 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) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] 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) [L798] 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) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 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 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 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 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 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 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] 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) [L872] 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)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] 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)) [L874] 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)) [L875] 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)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] 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)) [L876] 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)) [L877] 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)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 75768.8ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4403.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6378.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 77 SDtfs, 60 SDslu, 36 SDs, 0 SdLazy, 901 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1516.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1658.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=910occurred in iteration=12, InterpolantAutomatonStates: 117, 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: 78.0ms SsaConstructionTime, 739.7ms SatisfiabilityAnalysisTime, 2197.7ms InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 2490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...