/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-28 19:11:26,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-28 19:11:26,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-28 19:11:26,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-28 19:11:26,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-28 19:11:26,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-28 19:11:26,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-28 19:11:26,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-28 19:11:26,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-28 19:11:26,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-28 19:11:26,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-28 19:11:26,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-28 19:11:26,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-28 19:11:26,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-28 19:11:26,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-28 19:11:26,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-28 19:11:26,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-28 19:11:26,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-28 19:11:26,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-28 19:11:26,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-28 19:11:26,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-28 19:11:26,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-28 19:11:26,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-28 19:11:26,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-28 19:11:26,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-28 19:11:26,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-28 19:11:26,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-28 19:11:26,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-28 19:11:26,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-28 19:11:26,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-28 19:11:26,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-28 19:11:26,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-28 19:11:26,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-28 19:11:26,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-28 19:11:26,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-28 19:11:26,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-28 19:11:26,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-28 19:11:26,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-28 19:11:26,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-28 19:11:26,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-28 19:11:26,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-28 19:11:26,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-28 19:11:26,938 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-28 19:11:26,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-28 19:11:26,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-28 19:11:26,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-28 19:11:26,944 INFO L138 SettingsManager]: * Use SBE=true [2021-04-28 19:11:26,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-28 19:11:26,945 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-28 19:11:26,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-28 19:11:26,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-28 19:11:26,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-28 19:11:26,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-28 19:11:26,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-28 19:11:26,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-28 19:11:26,947 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-28 19:11:26,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-28 19:11:26,948 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-28 19:11:26,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-28 19:11:26,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-28 19:11:26,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-28 19:11:26,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-28 19:11:26,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-28 19:11:26,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-28 19:11:26,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-28 19:11:26,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-28 19:11:26,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-28 19:11:26,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-28 19:11:26,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-28 19:11:26,951 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-28 19:11:26,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-28 19:11:26,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-28 19:11:26,952 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-04-28 19:11:27,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-28 19:11:27,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-28 19:11:27,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-28 19:11:27,392 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-28 19:11:27,393 INFO L275 PluginConnector]: CDTParser initialized [2021-04-28 19:11:27,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2021-04-28 19:11:27,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fcc6514c/fac6d6f9a53d42bfbdebaa0591d10f74/FLAG8e74fbd31 [2021-04-28 19:11:28,114 INFO L306 CDTParser]: Found 1 translation units. [2021-04-28 19:11:28,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2021-04-28 19:11:28,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fcc6514c/fac6d6f9a53d42bfbdebaa0591d10f74/FLAG8e74fbd31 [2021-04-28 19:11:28,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fcc6514c/fac6d6f9a53d42bfbdebaa0591d10f74 [2021-04-28 19:11:28,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-28 19:11:28,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-28 19:11:28,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-28 19:11:28,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-28 19:11:28,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-28 19:11:28,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:11:28" (1/1) ... [2021-04-28 19:11:28,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d820214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:28, skipping insertion in model container [2021-04-28 19:11:28,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:11:28" (1/1) ... [2021-04-28 19:11:28,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-28 19:11:28,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-28 19:11:28,710 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/mix025_rmo.opt.i[991,1004] [2021-04-28 19:11:29,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 19:11:29,035 INFO L203 MainTranslator]: Completed pre-run [2021-04-28 19:11:29,049 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/mix025_rmo.opt.i[991,1004] [2021-04-28 19:11:29,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 19:11:29,237 INFO L208 MainTranslator]: Completed translation [2021-04-28 19:11:29,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29 WrapperNode [2021-04-28 19:11:29,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-28 19:11:29,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-28 19:11:29,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-28 19:11:29,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-28 19:11:29,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-28 19:11:29,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-28 19:11:29,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-28 19:11:29,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-28 19:11:29,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... [2021-04-28 19:11:29,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-28 19:11:29,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-28 19:11:29,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-28 19:11:29,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-28 19:11:29,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-28 19:11:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-28 19:11:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-28 19:11:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-28 19:11:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-28 19:11:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-28 19:11:29,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-28 19:11:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-28 19:11:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-28 19:11:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-28 19:11:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-28 19:11:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-28 19:11:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-28 19:11:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-28 19:11:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-28 19:11:29,509 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-28 19:11:31,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-28 19:11:31,700 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-28 19:11:31,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:11:31 BoogieIcfgContainer [2021-04-28 19:11:31,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-28 19:11:31,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-28 19:11:31,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-28 19:11:31,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-28 19:11:31,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:11:28" (1/3) ... [2021-04-28 19:11:31,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536e893e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:11:31, skipping insertion in model container [2021-04-28 19:11:31,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:11:29" (2/3) ... [2021-04-28 19:11:31,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536e893e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:11:31, skipping insertion in model container [2021-04-28 19:11:31,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:11:31" (3/3) ... [2021-04-28 19:11:31,712 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2021-04-28 19:11:31,720 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-28 19:11:31,726 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-28 19:11:31,727 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-28 19:11:31,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,786 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,792 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,792 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,809 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,815 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 19:11:31,822 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-28 19:11:31,847 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-28 19:11:31,875 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-28 19:11:31,875 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-28 19:11:31,875 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-28 19:11:31,875 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-28 19:11:31,875 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-28 19:11:31,876 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-28 19:11:31,876 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-28 19:11:31,876 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-28 19:11:31,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-04-28 19:11:31,946 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-04-28 19:11:31,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 19:11:31,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-28 19:11:31,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-04-28 19:11:31,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-04-28 19:11:31,960 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:11:31,981 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-04-28 19:11:31,985 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-04-28 19:11:31,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-04-28 19:11:32,014 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-04-28 19:11:32,014 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 19:11:32,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-28 19:11:32,019 INFO L146 LiptonReduction]: Number of co-enabled transitions 1668 [2021-04-28 19:11:34,301 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-28 19:11:34,432 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-28 19:11:34,882 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-28 19:11:35,055 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-28 19:11:36,782 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 19:11:36,964 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 19:11:48,583 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 19:11:52,519 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-28 19:11:54,647 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-28 19:11:54,975 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 19:11:55,083 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 19:11:55,188 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 19:11:55,295 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 19:11:56,513 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:11:56,629 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:11:56,747 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:11:56,877 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 19:11:57,003 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 19:11:57,164 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 19:11:57,289 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 19:11:57,648 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2021-04-28 19:11:57,815 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-04-28 19:11:58,180 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2021-04-28 19:11:58,350 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-04-28 19:11:58,494 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:11:58,639 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:11:58,785 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:11:58,929 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:11:59,314 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:11:59,434 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:11:59,589 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:11:59,715 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:11:59,859 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:11:59,997 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:00,140 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:00,283 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:00,397 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 19:12:00,508 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 19:12:00,619 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 19:12:00,729 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 19:12:00,868 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 19:12:01,013 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 19:12:01,153 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 19:12:01,296 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 19:12:01,436 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:01,575 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:01,720 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:01,865 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:02,017 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:12:02,160 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:12:02,306 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:12:02,446 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 19:12:02,604 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:02,766 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:02,925 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:03,068 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 19:12:03,186 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:03,307 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:03,417 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:03,530 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:03,915 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-04-28 19:12:04,094 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-04-28 19:12:04,465 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-04-28 19:12:04,644 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-04-28 19:12:04,765 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:04,881 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:05,010 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:05,127 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 19:12:05,265 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 19:12:05,401 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 19:12:05,539 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 19:12:05,676 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 19:12:05,799 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 19:12:05,919 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 19:12:06,046 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 19:12:06,172 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 19:12:06,232 INFO L158 LiptonReduction]: Checked pairs total: 17801 [2021-04-28 19:12:06,232 INFO L160 LiptonReduction]: Total number of compositions: 275 [2021-04-28 19:12:06,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34280 [2021-04-28 19:12:06,263 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2021-04-28 19:12:06,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 19:12:06,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:06,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-28 19:12:06,265 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1109071727, now seen corresponding path program 1 times [2021-04-28 19:12:06,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:06,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481383353] [2021-04-28 19:12:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:06,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:06,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 19:12:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:06,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481383353] [2021-04-28 19:12:06,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:06,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 19:12:06,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796345268] [2021-04-28 19:12:06,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 19:12:06,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 19:12:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 19:12:06,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 374 [2021-04-28 19:12:06,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 129 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:06,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:06,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 374 [2021-04-28 19:12:06,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:06,852 INFO L129 PetriNetUnfolder]: 29/400 cut-off events. [2021-04-28 19:12:06,852 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 19:12:06,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 400 events. 29/400 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3148 event pairs, 15 based on Foata normal form. 23/103 useless extension candidates. Maximal degree in co-relation 400. Up to 41 conditions per place. [2021-04-28 19:12:06,860 INFO L132 encePairwiseOnDemand]: 354/374 looper letters, 7 selfloop transitions, 2 changer transitions 56/128 dead transitions. [2021-04-28 19:12:06,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 128 transitions, 311 flow [2021-04-28 19:12:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 19:12:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 19:12:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2021-04-28 19:12:06,884 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2021-04-28 19:12:06,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2021-04-28 19:12:06,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2021-04-28 19:12:06,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:06,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2021-04-28 19:12:06,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:06,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 374.0) internal successors, (1496), 4 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:06,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 374.0) internal successors, (1496), 4 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:06,917 INFO L185 Difference]: Start difference. First operand has 138 places, 129 transitions, 267 flow. Second operand 3 states and 891 transitions. [2021-04-28 19:12:06,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 128 transitions, 311 flow [2021-04-28 19:12:06,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 128 transitions, 308 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-28 19:12:06,927 INFO L241 Difference]: Finished difference. Result has 134 places, 69 transitions, 148 flow [2021-04-28 19:12:06,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=134, PETRI_TRANSITIONS=69} [2021-04-28 19:12:06,931 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -4 predicate places. [2021-04-28 19:12:06,932 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:06,932 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 69 transitions, 148 flow [2021-04-28 19:12:06,932 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 69 transitions, 148 flow [2021-04-28 19:12:06,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 148 flow [2021-04-28 19:12:06,944 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2021-04-28 19:12:06,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 19:12:06,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 332 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-28 19:12:06,946 INFO L146 LiptonReduction]: Number of co-enabled transitions 2100 [2021-04-28 19:12:07,177 INFO L158 LiptonReduction]: Checked pairs total: 2680 [2021-04-28 19:12:07,177 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:07,177 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 245 [2021-04-28 19:12:07,180 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 148 flow [2021-04-28 19:12:07,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:07,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:07,182 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:07,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-28 19:12:07,182 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 171797956, now seen corresponding path program 1 times [2021-04-28 19:12:07,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:07,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712372409] [2021-04-28 19:12:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:07,279 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 19:12:07,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 19:12:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:07,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712372409] [2021-04-28 19:12:07,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:07,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 19:12:07,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966405532] [2021-04-28 19:12:07,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 19:12:07,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:07,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 19:12:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 19:12:07,298 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 374 [2021-04-28 19:12:07,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:07,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:07,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 374 [2021-04-28 19:12:07,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:08,073 INFO L129 PetriNetUnfolder]: 966/3015 cut-off events. [2021-04-28 19:12:08,074 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 19:12:08,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4661 conditions, 3015 events. 966/3015 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 33500 event pairs, 276 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 4652. Up to 1001 conditions per place. [2021-04-28 19:12:08,088 INFO L132 encePairwiseOnDemand]: 354/374 looper letters, 6 selfloop transitions, 6 changer transitions 48/96 dead transitions. [2021-04-28 19:12:08,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 96 transitions, 318 flow [2021-04-28 19:12:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 19:12:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 19:12:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2021-04-28 19:12:08,092 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2021-04-28 19:12:08,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 697 transitions. [2021-04-28 19:12:08,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 697 transitions. [2021-04-28 19:12:08,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:08,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 697 transitions. [2021-04-28 19:12:08,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 374.0) internal successors, (1496), 4 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 374.0) internal successors, (1496), 4 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,100 INFO L185 Difference]: Start difference. First operand has 78 places, 69 transitions, 148 flow. Second operand 3 states and 697 transitions. [2021-04-28 19:12:08,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 96 transitions, 318 flow [2021-04-28 19:12:08,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 96 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 19:12:08,104 INFO L241 Difference]: Finished difference. Result has 80 places, 48 transitions, 138 flow [2021-04-28 19:12:08,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=80, PETRI_TRANSITIONS=48} [2021-04-28 19:12:08,105 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -58 predicate places. [2021-04-28 19:12:08,106 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:08,106 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 48 transitions, 138 flow [2021-04-28 19:12:08,107 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 48 transitions, 138 flow [2021-04-28 19:12:08,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 138 flow [2021-04-28 19:12:08,156 INFO L129 PetriNetUnfolder]: 38/217 cut-off events. [2021-04-28 19:12:08,156 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-04-28 19:12:08,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 217 events. 38/217 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1361 event pairs, 18 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 334. Up to 67 conditions per place. [2021-04-28 19:12:08,164 INFO L146 LiptonReduction]: Number of co-enabled transitions 1250 [2021-04-28 19:12:08,303 INFO L158 LiptonReduction]: Checked pairs total: 618 [2021-04-28 19:12:08,304 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:08,304 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 198 [2021-04-28 19:12:08,307 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 138 flow [2021-04-28 19:12:08,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:08,308 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:08,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-28 19:12:08,309 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1030766884, now seen corresponding path program 1 times [2021-04-28 19:12:08,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:08,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803206946] [2021-04-28 19:12:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:08,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:08,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:08,455 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 19:12:08,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 19:12:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:08,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803206946] [2021-04-28 19:12:08,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:08,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 19:12:08,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110267055] [2021-04-28 19:12:08,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 19:12:08,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 19:12:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 19:12:08,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 374 [2021-04-28 19:12:08,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:08,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 374 [2021-04-28 19:12:08,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:08,537 INFO L129 PetriNetUnfolder]: 26/156 cut-off events. [2021-04-28 19:12:08,537 INFO L130 PetriNetUnfolder]: For 25/44 co-relation queries the response was YES. [2021-04-28 19:12:08,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 156 events. 26/156 cut-off events. For 25/44 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 822 event pairs, 4 based on Foata normal form. 4/109 useless extension candidates. Maximal degree in co-relation 305. Up to 49 conditions per place. [2021-04-28 19:12:08,539 INFO L132 encePairwiseOnDemand]: 368/374 looper letters, 9 selfloop transitions, 6 changer transitions 1/51 dead transitions. [2021-04-28 19:12:08,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 184 flow [2021-04-28 19:12:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 19:12:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 19:12:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2021-04-28 19:12:08,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5802139037433155 [2021-04-28 19:12:08,544 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 868 transitions. [2021-04-28 19:12:08,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions. [2021-04-28 19:12:08,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:08,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions. [2021-04-28 19:12:08,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 374.0) internal successors, (1870), 5 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 374.0) internal successors, (1870), 5 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,555 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 138 flow. Second operand 4 states and 868 transitions. [2021-04-28 19:12:08,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 184 flow [2021-04-28 19:12:08,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 19:12:08,559 INFO L241 Difference]: Finished difference. Result has 58 places, 49 transitions, 162 flow [2021-04-28 19:12:08,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2021-04-28 19:12:08,560 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -80 predicate places. [2021-04-28 19:12:08,560 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:08,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 49 transitions, 162 flow [2021-04-28 19:12:08,560 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 162 flow [2021-04-28 19:12:08,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 162 flow [2021-04-28 19:12:08,591 INFO L129 PetriNetUnfolder]: 26/167 cut-off events. [2021-04-28 19:12:08,592 INFO L130 PetriNetUnfolder]: For 45/48 co-relation queries the response was YES. [2021-04-28 19:12:08,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 167 events. 26/167 cut-off events. For 45/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 935 event pairs, 12 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 287. Up to 49 conditions per place. [2021-04-28 19:12:08,597 INFO L146 LiptonReduction]: Number of co-enabled transitions 1268 [2021-04-28 19:12:08,606 INFO L158 LiptonReduction]: Checked pairs total: 690 [2021-04-28 19:12:08,607 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:08,607 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-04-28 19:12:08,609 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 162 flow [2021-04-28 19:12:08,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,610 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:08,611 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:08,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-28 19:12:08,611 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:08,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1888998450, now seen corresponding path program 1 times [2021-04-28 19:12:08,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:08,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308718029] [2021-04-28 19:12:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:08,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:08,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:08,700 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-28 19:12:08,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-28 19:12:08,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:08,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 19:12:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:08,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308718029] [2021-04-28 19:12:08,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:08,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 19:12:08,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846519841] [2021-04-28 19:12:08,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 19:12:08,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 19:12:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 19:12:08,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 374 [2021-04-28 19:12:08,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 240.75) internal successors, (963), 4 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:08,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:08,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 374 [2021-04-28 19:12:08,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:10,498 INFO L129 PetriNetUnfolder]: 8108/13787 cut-off events. [2021-04-28 19:12:10,498 INFO L130 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2021-04-28 19:12:10,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27697 conditions, 13787 events. 8108/13787 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 3189. Compared 130211 event pairs, 1039 based on Foata normal form. 208/3666 useless extension candidates. Maximal degree in co-relation 27683. Up to 7831 conditions per place. [2021-04-28 19:12:10,592 INFO L132 encePairwiseOnDemand]: 355/374 looper letters, 32 selfloop transitions, 22 changer transitions 0/79 dead transitions. [2021-04-28 19:12:10,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 330 flow [2021-04-28 19:12:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 19:12:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 19:12:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2021-04-28 19:12:10,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6744652406417112 [2021-04-28 19:12:10,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2021-04-28 19:12:10,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2021-04-28 19:12:10,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:10,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2021-04-28 19:12:10,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.25) internal successors, (1009), 4 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:10,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 374.0) internal successors, (1870), 5 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:10,609 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 374.0) internal successors, (1870), 5 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:10,610 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 162 flow. Second operand 4 states and 1009 transitions. [2021-04-28 19:12:10,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 330 flow [2021-04-28 19:12:10,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 19:12:10,621 INFO L241 Difference]: Finished difference. Result has 61 places, 69 transitions, 318 flow [2021-04-28 19:12:10,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2021-04-28 19:12:10,622 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -77 predicate places. [2021-04-28 19:12:10,622 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:10,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 69 transitions, 318 flow [2021-04-28 19:12:10,622 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 69 transitions, 318 flow [2021-04-28 19:12:10,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 69 transitions, 318 flow [2021-04-28 19:12:11,395 INFO L129 PetriNetUnfolder]: 3161/6812 cut-off events. [2021-04-28 19:12:11,395 INFO L130 PetriNetUnfolder]: For 457/2075 co-relation queries the response was YES. [2021-04-28 19:12:11,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15166 conditions, 6812 events. 3161/6812 cut-off events. For 457/2075 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 75760 event pairs, 980 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 15151. Up to 5983 conditions per place. [2021-04-28 19:12:11,526 INFO L146 LiptonReduction]: Number of co-enabled transitions 1806 [2021-04-28 19:12:11,562 INFO L158 LiptonReduction]: Checked pairs total: 915 [2021-04-28 19:12:11,562 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:11,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 941 [2021-04-28 19:12:11,568 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 318 flow [2021-04-28 19:12:11,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 240.75) internal successors, (963), 4 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:11,569 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:11,569 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:11,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-28 19:12:11,569 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 504478393, now seen corresponding path program 1 times [2021-04-28 19:12:11,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:11,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003291650] [2021-04-28 19:12:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:11,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:11,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:11,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:11,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:11,717 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-28 19:12:11,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-28 19:12:11,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:11,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 19:12:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:11,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003291650] [2021-04-28 19:12:11,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:11,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 19:12:11,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391028447] [2021-04-28 19:12:11,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 19:12:11,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 19:12:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 19:12:11,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 374 [2021-04-28 19:12:11,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:11,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:11,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 374 [2021-04-28 19:12:11,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:13,861 INFO L129 PetriNetUnfolder]: 7556/14822 cut-off events. [2021-04-28 19:12:13,861 INFO L130 PetriNetUnfolder]: For 2994/67333 co-relation queries the response was YES. [2021-04-28 19:12:13,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47370 conditions, 14822 events. 7556/14822 cut-off events. For 2994/67333 co-relation queries the response was YES. Maximal size of possible extension queue 3963. Compared 164504 event pairs, 10 based on Foata normal form. 226/4232 useless extension candidates. Maximal degree in co-relation 47353. Up to 11980 conditions per place. [2021-04-28 19:12:13,988 INFO L132 encePairwiseOnDemand]: 355/374 looper letters, 44 selfloop transitions, 31 changer transitions 0/100 dead transitions. [2021-04-28 19:12:13,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 599 flow [2021-04-28 19:12:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 19:12:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 19:12:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1266 transitions. [2021-04-28 19:12:13,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6770053475935829 [2021-04-28 19:12:13,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1266 transitions. [2021-04-28 19:12:13,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1266 transitions. [2021-04-28 19:12:13,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:13,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1266 transitions. [2021-04-28 19:12:13,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 253.2) internal successors, (1266), 5 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:14,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 374.0) internal successors, (2244), 6 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:14,008 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 374.0) internal successors, (2244), 6 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:14,008 INFO L185 Difference]: Start difference. First operand has 61 places, 69 transitions, 318 flow. Second operand 5 states and 1266 transitions. [2021-04-28 19:12:14,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 599 flow [2021-04-28 19:12:14,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 575 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 19:12:14,015 INFO L241 Difference]: Finished difference. Result has 66 places, 89 transitions, 530 flow [2021-04-28 19:12:14,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=66, PETRI_TRANSITIONS=89} [2021-04-28 19:12:14,015 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -72 predicate places. [2021-04-28 19:12:14,015 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:14,016 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 89 transitions, 530 flow [2021-04-28 19:12:14,016 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 89 transitions, 530 flow [2021-04-28 19:12:14,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 89 transitions, 530 flow [2021-04-28 19:12:15,350 INFO L129 PetriNetUnfolder]: 5169/11718 cut-off events. [2021-04-28 19:12:15,350 INFO L130 PetriNetUnfolder]: For 12803/39861 co-relation queries the response was YES. [2021-04-28 19:12:15,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42268 conditions, 11718 events. 5169/11718 cut-off events. For 12803/39861 co-relation queries the response was YES. Maximal size of possible extension queue 3171. Compared 144964 event pairs, 83 based on Foata normal form. 9/3060 useless extension candidates. Maximal degree in co-relation 42250. Up to 9685 conditions per place. [2021-04-28 19:12:15,566 INFO L146 LiptonReduction]: Number of co-enabled transitions 2164 [2021-04-28 19:12:15,617 INFO L158 LiptonReduction]: Checked pairs total: 1479 [2021-04-28 19:12:15,617 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:15,617 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1602 [2021-04-28 19:12:15,625 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 89 transitions, 530 flow [2021-04-28 19:12:15,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:15,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:15,627 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:15,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-28 19:12:15,628 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1556172126, now seen corresponding path program 1 times [2021-04-28 19:12:15,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:15,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358391886] [2021-04-28 19:12:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:15,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:15,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 19:12:15,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:15,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:15,749 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 19:12:15,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 19:12:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:15,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358391886] [2021-04-28 19:12:15,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:15,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 19:12:15,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526713108] [2021-04-28 19:12:15,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 19:12:15,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:15,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 19:12:15,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 19:12:15,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 374 [2021-04-28 19:12:15,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 89 transitions, 530 flow. Second operand has 4 states, 4 states have (on average 212.75) internal successors, (851), 4 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:15,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:15,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 374 [2021-04-28 19:12:15,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:17,693 INFO L129 PetriNetUnfolder]: 7325/16060 cut-off events. [2021-04-28 19:12:17,694 INFO L130 PetriNetUnfolder]: For 22512/76806 co-relation queries the response was YES. [2021-04-28 19:12:17,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57737 conditions, 16060 events. 7325/16060 cut-off events. For 22512/76806 co-relation queries the response was YES. Maximal size of possible extension queue 3942. Compared 194628 event pairs, 82 based on Foata normal form. 60/4265 useless extension candidates. Maximal degree in co-relation 57717. Up to 13456 conditions per place. [2021-04-28 19:12:17,829 INFO L132 encePairwiseOnDemand]: 366/374 looper letters, 11 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2021-04-28 19:12:17,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 652 flow [2021-04-28 19:12:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 19:12:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 19:12:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1078 transitions. [2021-04-28 19:12:17,834 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2021-04-28 19:12:17,834 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1078 transitions. [2021-04-28 19:12:17,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1078 transitions. [2021-04-28 19:12:17,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:17,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1078 transitions. [2021-04-28 19:12:17,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 215.6) internal successors, (1078), 5 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:17,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 374.0) internal successors, (2244), 6 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:17,844 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 374.0) internal successors, (2244), 6 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:17,844 INFO L185 Difference]: Start difference. First operand has 66 places, 89 transitions, 530 flow. Second operand 5 states and 1078 transitions. [2021-04-28 19:12:17,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 652 flow [2021-04-28 19:12:17,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 611 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-04-28 19:12:17,905 INFO L241 Difference]: Finished difference. Result has 71 places, 98 transitions, 607 flow [2021-04-28 19:12:17,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=71, PETRI_TRANSITIONS=98} [2021-04-28 19:12:17,905 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -67 predicate places. [2021-04-28 19:12:17,905 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:17,906 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 98 transitions, 607 flow [2021-04-28 19:12:17,906 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 98 transitions, 607 flow [2021-04-28 19:12:17,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 98 transitions, 607 flow [2021-04-28 19:12:19,470 INFO L129 PetriNetUnfolder]: 7521/16805 cut-off events. [2021-04-28 19:12:19,471 INFO L130 PetriNetUnfolder]: For 6908/36501 co-relation queries the response was YES. [2021-04-28 19:12:19,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51785 conditions, 16805 events. 7521/16805 cut-off events. For 6908/36501 co-relation queries the response was YES. Maximal size of possible extension queue 4530. Compared 216985 event pairs, 92 based on Foata normal form. 12/4169 useless extension candidates. Maximal degree in co-relation 51764. Up to 13186 conditions per place. [2021-04-28 19:12:19,702 INFO L146 LiptonReduction]: Number of co-enabled transitions 2778 [2021-04-28 19:12:19,823 INFO L158 LiptonReduction]: Checked pairs total: 1578 [2021-04-28 19:12:19,824 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:19,824 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1919 [2021-04-28 19:12:19,829 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 98 transitions, 607 flow [2021-04-28 19:12:19,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 212.75) internal successors, (851), 4 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:19,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:19,830 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:19,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-28 19:12:19,830 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -175023692, now seen corresponding path program 2 times [2021-04-28 19:12:19,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:19,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197936926] [2021-04-28 19:12:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:19,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:19,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 19:12:19,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:19,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:19,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:19,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:19,939 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 19:12:19,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 19:12:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:19,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197936926] [2021-04-28 19:12:19,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:19,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 19:12:19,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102346754] [2021-04-28 19:12:19,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 19:12:19,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 19:12:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 19:12:19,955 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 374 [2021-04-28 19:12:19,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 98 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 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-04-28 19:12:19,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:19,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 374 [2021-04-28 19:12:19,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:22,248 INFO L129 PetriNetUnfolder]: 11211/23538 cut-off events. [2021-04-28 19:12:22,248 INFO L130 PetriNetUnfolder]: For 10277/50018 co-relation queries the response was YES. [2021-04-28 19:12:22,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72422 conditions, 23538 events. 11211/23538 cut-off events. For 10277/50018 co-relation queries the response was YES. Maximal size of possible extension queue 6084. Compared 295276 event pairs, 136 based on Foata normal form. 93/6402 useless extension candidates. Maximal degree in co-relation 72399. Up to 19216 conditions per place. [2021-04-28 19:12:22,343 INFO L132 encePairwiseOnDemand]: 366/374 looper letters, 9 selfloop transitions, 16 changer transitions 4/103 dead transitions. [2021-04-28 19:12:22,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 708 flow [2021-04-28 19:12:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-28 19:12:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-28 19:12:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2021-04-28 19:12:22,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753119429590018 [2021-04-28 19:12:22,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1291 transitions. [2021-04-28 19:12:22,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1291 transitions. [2021-04-28 19:12:22,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:22,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1291 transitions. [2021-04-28 19:12:22,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:22,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 374.0) internal successors, (2618), 7 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:22,363 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 374.0) internal successors, (2618), 7 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:22,363 INFO L185 Difference]: Start difference. First operand has 71 places, 98 transitions, 607 flow. Second operand 6 states and 1291 transitions. [2021-04-28 19:12:22,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 708 flow [2021-04-28 19:12:22,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 708 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-28 19:12:22,475 INFO L241 Difference]: Finished difference. Result has 77 places, 96 transitions, 625 flow [2021-04-28 19:12:22,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=625, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2021-04-28 19:12:22,476 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -61 predicate places. [2021-04-28 19:12:22,476 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:22,476 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 96 transitions, 625 flow [2021-04-28 19:12:22,476 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 96 transitions, 625 flow [2021-04-28 19:12:22,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 96 transitions, 625 flow [2021-04-28 19:12:23,996 INFO L129 PetriNetUnfolder]: 7517/16731 cut-off events. [2021-04-28 19:12:23,996 INFO L130 PetriNetUnfolder]: For 7188/36982 co-relation queries the response was YES. [2021-04-28 19:12:24,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51637 conditions, 16731 events. 7517/16731 cut-off events. For 7188/36982 co-relation queries the response was YES. Maximal size of possible extension queue 4530. Compared 215284 event pairs, 92 based on Foata normal form. 13/4159 useless extension candidates. Maximal degree in co-relation 51613. Up to 13186 conditions per place. [2021-04-28 19:12:24,170 INFO L146 LiptonReduction]: Number of co-enabled transitions 2572 [2021-04-28 19:12:24,241 INFO L158 LiptonReduction]: Checked pairs total: 1481 [2021-04-28 19:12:24,242 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:24,242 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1766 [2021-04-28 19:12:24,245 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 625 flow [2021-04-28 19:12:24,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 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-04-28 19:12:24,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:24,246 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 19:12:24,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-28 19:12:24,247 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -316072906, now seen corresponding path program 3 times [2021-04-28 19:12:24,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:24,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894450678] [2021-04-28 19:12:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:24,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:24,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:24,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:24,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:24,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:24,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:24,415 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-04-28 19:12:24,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-28 19:12:24,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:24,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 19:12:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:24,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894450678] [2021-04-28 19:12:24,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:24,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-28 19:12:24,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279344198] [2021-04-28 19:12:24,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-28 19:12:24,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-28 19:12:24,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-28 19:12:24,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 374 [2021-04-28 19:12:24,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 240.83333333333334) internal successors, (1445), 6 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:24,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:24,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 374 [2021-04-28 19:12:24,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:26,687 INFO L129 PetriNetUnfolder]: 9205/19359 cut-off events. [2021-04-28 19:12:26,687 INFO L130 PetriNetUnfolder]: For 12436/418093 co-relation queries the response was YES. [2021-04-28 19:12:26,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77832 conditions, 19359 events. 9205/19359 cut-off events. For 12436/418093 co-relation queries the response was YES. Maximal size of possible extension queue 4797. Compared 236816 event pairs, 0 based on Foata normal form. 260/4995 useless extension candidates. Maximal degree in co-relation 77806. Up to 15067 conditions per place. [2021-04-28 19:12:26,758 INFO L132 encePairwiseOnDemand]: 355/374 looper letters, 37 selfloop transitions, 29 changer transitions 12/110 dead transitions. [2021-04-28 19:12:26,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 853 flow [2021-04-28 19:12:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-28 19:12:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-28 19:12:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1505 transitions. [2021-04-28 19:12:26,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6706773618538324 [2021-04-28 19:12:26,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1505 transitions. [2021-04-28 19:12:26,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1505 transitions. [2021-04-28 19:12:26,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:26,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1505 transitions. [2021-04-28 19:12:26,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 250.83333333333334) internal successors, (1505), 6 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:26,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 374.0) internal successors, (2618), 7 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:26,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 374.0) internal successors, (2618), 7 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:26,776 INFO L185 Difference]: Start difference. First operand has 77 places, 96 transitions, 625 flow. Second operand 6 states and 1505 transitions. [2021-04-28 19:12:26,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 853 flow [2021-04-28 19:12:26,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 804 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-04-28 19:12:26,847 INFO L241 Difference]: Finished difference. Result has 77 places, 96 transitions, 688 flow [2021-04-28 19:12:26,847 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2021-04-28 19:12:26,848 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -61 predicate places. [2021-04-28 19:12:26,848 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:26,848 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 96 transitions, 688 flow [2021-04-28 19:12:26,848 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 96 transitions, 688 flow [2021-04-28 19:12:26,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 96 transitions, 688 flow [2021-04-28 19:12:28,427 INFO L129 PetriNetUnfolder]: 8632/17549 cut-off events. [2021-04-28 19:12:28,427 INFO L130 PetriNetUnfolder]: For 42192/208291 co-relation queries the response was YES. [2021-04-28 19:12:28,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78724 conditions, 17549 events. 8632/17549 cut-off events. For 42192/208291 co-relation queries the response was YES. Maximal size of possible extension queue 5033. Compared 211337 event pairs, 0 based on Foata normal form. 0/4324 useless extension candidates. Maximal degree in co-relation 78701. Up to 14554 conditions per place. [2021-04-28 19:12:28,608 INFO L146 LiptonReduction]: Number of co-enabled transitions 2262 [2021-04-28 19:12:28,900 INFO L158 LiptonReduction]: Checked pairs total: 1412 [2021-04-28 19:12:28,901 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 19:12:28,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2053 [2021-04-28 19:12:28,902 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 688 flow [2021-04-28 19:12:28,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 240.83333333333334) internal successors, (1445), 6 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:28,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:28,903 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-04-28 19:12:28,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-28 19:12:28,904 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1235238808, now seen corresponding path program 1 times [2021-04-28 19:12:28,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:28,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429853117] [2021-04-28 19:12:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 19:12:28,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:28,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 19:12:28,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 19:12:28,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 19:12:28,972 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 19:12:28,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 19:12:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 19:12:28,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429853117] [2021-04-28 19:12:28,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 19:12:28,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 19:12:28,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206088997] [2021-04-28 19:12:28,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 19:12:28,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 19:12:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 19:12:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 19:12:28,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 374 [2021-04-28 19:12:28,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 688 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:28,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 19:12:28,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 374 [2021-04-28 19:12:28,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 19:12:31,425 INFO L129 PetriNetUnfolder]: 13752/27112 cut-off events. [2021-04-28 19:12:31,425 INFO L130 PetriNetUnfolder]: For 64178/256275 co-relation queries the response was YES. [2021-04-28 19:12:31,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122780 conditions, 27112 events. 13752/27112 cut-off events. For 64178/256275 co-relation queries the response was YES. Maximal size of possible extension queue 7884. Compared 327847 event pairs, 0 based on Foata normal form. 32/7009 useless extension candidates. Maximal degree in co-relation 122755. Up to 23014 conditions per place. [2021-04-28 19:12:31,510 INFO L132 encePairwiseOnDemand]: 369/374 looper letters, 4 selfloop transitions, 3 changer transitions 56/104 dead transitions. [2021-04-28 19:12:31,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 798 flow [2021-04-28 19:12:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 19:12:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 19:12:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 871 transitions. [2021-04-28 19:12:31,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5822192513368984 [2021-04-28 19:12:31,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 871 transitions. [2021-04-28 19:12:31,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 871 transitions. [2021-04-28 19:12:31,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 19:12:31,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 871 transitions. [2021-04-28 19:12:31,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:31,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 374.0) internal successors, (1870), 5 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:31,521 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 374.0) internal successors, (1870), 5 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:31,522 INFO L185 Difference]: Start difference. First operand has 76 places, 96 transitions, 688 flow. Second operand 4 states and 871 transitions. [2021-04-28 19:12:31,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 798 flow [2021-04-28 19:12:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 732 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-04-28 19:12:34,954 INFO L241 Difference]: Finished difference. Result has 77 places, 48 transitions, 307 flow [2021-04-28 19:12:34,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=77, PETRI_TRANSITIONS=48} [2021-04-28 19:12:34,954 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -61 predicate places. [2021-04-28 19:12:34,954 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 19:12:34,955 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 48 transitions, 307 flow [2021-04-28 19:12:34,955 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 48 transitions, 307 flow [2021-04-28 19:12:34,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 48 transitions, 307 flow [2021-04-28 19:12:34,982 INFO L129 PetriNetUnfolder]: 91/268 cut-off events. [2021-04-28 19:12:34,982 INFO L130 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2021-04-28 19:12:34,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 268 events. 91/268 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1550 event pairs, 1 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 1028. Up to 109 conditions per place. [2021-04-28 19:12:34,985 INFO L146 LiptonReduction]: Number of co-enabled transitions 368 [2021-04-28 19:12:36,243 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-04-28 19:12:36,768 WARN L205 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-04-28 19:12:38,771 WARN L205 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-28 19:12:39,686 WARN L205 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-04-28 19:12:39,854 INFO L158 LiptonReduction]: Checked pairs total: 760 [2021-04-28 19:12:39,854 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-28 19:12:39,855 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4901 [2021-04-28 19:12:39,856 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 310 flow [2021-04-28 19:12:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 19:12:39,856 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 19:12:39,856 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-04-28 19:12:39,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-28 19:12:39,857 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 19:12:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 19:12:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -608246303, now seen corresponding path program 1 times [2021-04-28 19:12:39,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 19:12:39,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758849273] [2021-04-28 19:12:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 19:12:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 19:12:39,909 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 19:12:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 19:12:39,960 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 19:12:39,999 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-28 19:12:39,999 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-28 19:12:39,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-28 19:12:40,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:12:40 BasicIcfg [2021-04-28 19:12:40,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-28 19:12:40,158 INFO L168 Benchmark]: Toolchain (without parser) took 71755.50 ms. Allocated memory was 302.0 MB in the beginning and 10.1 GB in the end (delta: 9.8 GB). Free memory was 277.2 MB in the beginning and 9.0 GB in the end (delta: -8.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. [2021-04-28 19:12:40,158 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 302.0 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-28 19:12:40,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.74 ms. Allocated memory is still 302.0 MB. Free memory was 273.8 MB in the beginning and 278.7 MB in the end (delta: -4.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. [2021-04-28 19:12:40,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.88 ms. Allocated memory is still 302.0 MB. Free memory was 278.7 MB in the beginning and 276.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 19:12:40,159 INFO L168 Benchmark]: Boogie Preprocessor took 48.33 ms. Allocated memory is still 302.0 MB. Free memory was 276.6 MB in the beginning and 274.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 19:12:40,160 INFO L168 Benchmark]: RCFGBuilder took 2330.35 ms. Allocated memory was 302.0 MB in the beginning and 377.5 MB in the end (delta: 75.5 MB). Free memory was 274.5 MB in the beginning and 310.3 MB in the end (delta: -35.9 MB). Peak memory consumption was 171.8 MB. Max. memory is 16.0 GB. [2021-04-28 19:12:40,161 INFO L168 Benchmark]: TraceAbstraction took 68452.79 ms. Allocated memory was 377.5 MB in the beginning and 10.1 GB in the end (delta: 9.7 GB). Free memory was 309.3 MB in the beginning and 9.0 GB in the end (delta: -8.7 GB). Peak memory consumption was 967.8 MB. Max. memory is 16.0 GB. [2021-04-28 19:12:40,168 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.88 ms. Allocated memory is still 302.0 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 777.74 ms. Allocated memory is still 302.0 MB. Free memory was 273.8 MB in the beginning and 278.7 MB in the end (delta: -4.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.88 ms. Allocated memory is still 302.0 MB. Free memory was 278.7 MB in the beginning and 276.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.33 ms. Allocated memory is still 302.0 MB. Free memory was 276.6 MB in the beginning and 274.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2330.35 ms. Allocated memory was 302.0 MB in the beginning and 377.5 MB in the end (delta: 75.5 MB). Free memory was 274.5 MB in the beginning and 310.3 MB in the end (delta: -35.9 MB). Peak memory consumption was 171.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 68452.79 ms. Allocated memory was 377.5 MB in the beginning and 10.1 GB in the end (delta: 9.7 GB). Free memory was 309.3 MB in the beginning and 9.0 GB in the end (delta: -8.7 GB). Peak memory consumption was 967.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34247.3ms, 104 PlacesBefore, 138 PlacesAfterwards, 96 TransitionsBefore, 129 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 9 FixpointIterations, 175 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 275 TotalNumberOfCompositions, 17801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5546, positive: 5251, positive conditional: 5251, positive unconditional: 0, negative: 295, negative conditional: 295, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2522, positive: 2451, positive conditional: 0, positive unconditional: 2451, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2522, positive: 2451, positive conditional: 0, positive unconditional: 2451, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2522, positive: 2398, positive conditional: 0, positive unconditional: 2398, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1149, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 966, negative conditional: 0, negative unconditional: 966, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5546, positive: 2800, positive conditional: 2800, positive unconditional: 0, negative: 224, negative conditional: 224, negative unconditional: 0, unknown: 2522, unknown conditional: 2522, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2518, Positive cache size: 2447, Positive conditional cache size: 2447, Positive unconditional cache size: 0, Negative cache size: 71, Negative conditional cache size: 71, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 244.9ms, 134 PlacesBefore, 78 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 2100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2680 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 486, positive: 406, positive conditional: 406, positive unconditional: 0, negative: 80, negative conditional: 80, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, positive: 62, positive conditional: 1, positive unconditional: 61, negative: 23, negative conditional: 4, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, positive: 62, positive conditional: 1, positive unconditional: 61, negative: 23, negative conditional: 4, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 85, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 23, negative conditional: 4, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 206, negative conditional: 103, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 486, positive: 344, positive conditional: 344, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 85, unknown conditional: 85, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2603, Positive cache size: 2509, Positive conditional cache size: 2509, Positive unconditional cache size: 0, Negative cache size: 94, Negative conditional cache size: 94, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 197.2ms, 80 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 1250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 134, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 2, positive unconditional: 13, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 2, positive unconditional: 13, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 134, negative conditional: 5, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2622, Positive cache size: 2524, Positive conditional cache size: 2524, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.5ms, 58 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 690 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 137, positive conditional: 137, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, positive: 126, positive conditional: 126, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2634, Positive cache size: 2535, Positive conditional cache size: 2535, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 940.1ms, 61 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 915 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 243, positive: 225, positive conditional: 225, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 35, positive conditional: 13, positive unconditional: 22, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 35, positive conditional: 13, positive unconditional: 22, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 243, positive: 190, positive conditional: 190, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2670, Positive cache size: 2570, Positive conditional cache size: 2570, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1601.0ms, 66 PlacesBefore, 66 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 2164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1479 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 405, positive: 381, positive conditional: 381, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 38, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 38, 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: 39, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 405, positive: 342, positive conditional: 342, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2709, Positive cache size: 2609, Positive conditional cache size: 2609, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1917.7ms, 71 PlacesBefore, 71 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 2778 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1578 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 435, positive: 411, positive conditional: 411, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 25, positive unconditional: 7, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 25, positive unconditional: 7, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 90, negative conditional: 77, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 435, positive: 379, positive conditional: 379, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2743, Positive cache size: 2641, Positive conditional cache size: 2641, Positive unconditional cache size: 0, Negative cache size: 102, Negative conditional cache size: 102, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1765.4ms, 77 PlacesBefore, 77 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 509, positive: 486, positive conditional: 486, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 9, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 9, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 509, positive: 473, positive conditional: 473, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2757, Positive cache size: 2654, Positive conditional cache size: 2654, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2052.5ms, 77 PlacesBefore, 76 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 2262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 333, positive: 310, positive conditional: 310, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 139, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 139, negative conditional: 139, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, positive: 295, positive conditional: 295, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2774, Positive cache size: 2669, Positive conditional cache size: 2669, Positive unconditional cache size: 0, Negative cache size: 105, Negative conditional cache size: 105, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4899.2ms, 77 PlacesBefore, 62 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 760 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 265, positive: 229, positive conditional: 229, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 27, positive conditional: 19, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 27, positive conditional: 19, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 159, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 159, negative conditional: 0, negative unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 265, positive: 202, positive conditional: 202, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2805, Positive cache size: 2696, Positive conditional cache size: 2696, Positive unconditional cache size: 0, Negative cache size: 109, Negative conditional cache size: 109, Negative unconditional cache size: 0 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t672; [L835] FCALL, FORK 0 pthread_create(&t672, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L836] 0 pthread_t t673; [L837] FCALL, FORK 0 pthread_create(&t673, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L838] 0 pthread_t t674; [L839] FCALL, FORK 0 pthread_create(&t674, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L753] 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) [L754] 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)) [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 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] 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)) [L754] 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)) [L755] 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)) [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 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] 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)) [L755] 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)) [L756] 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)) [L756] 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) [L756] 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)) [L756] 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)) [L757] 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)) [L757] 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) [L757] 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)) [L757] 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)) [L758] 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)) [L758] 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) [L758] 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)) [L758] 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)) [L759] 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)) [L759] 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) [L759] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] 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) [L789] 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) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 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 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 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 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 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) [L812] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L812] 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) [L812] 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) [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 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 [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 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 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND FALSE 0 !(!cond) [L845] 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) [L845] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L845] 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) [L845] 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) [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 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 [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 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 [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 15.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 68131.3ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 18385.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 34371.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 112 SDtfs, 44 SDslu, 49 SDs, 0 SdLazy, 302 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 557.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 221.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=8, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.8ms SsaConstructionTime, 511.6ms SatisfiabilityAnalysisTime, 719.2ms InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...