/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/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-28 23:24:13,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-28 23:24:13,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-28 23:24:13,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-28 23:24:13,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-28 23:24:13,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-28 23:24:13,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-28 23:24:13,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-28 23:24:13,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-28 23:24:13,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-28 23:24:13,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-28 23:24:13,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-28 23:24:13,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-28 23:24:13,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-28 23:24:13,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-28 23:24:13,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-28 23:24:14,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-28 23:24:14,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-28 23:24:14,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-28 23:24:14,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-28 23:24:14,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-28 23:24:14,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-28 23:24:14,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-28 23:24:14,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-28 23:24:14,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-28 23:24:14,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-28 23:24:14,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-28 23:24:14,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-28 23:24:14,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-28 23:24:14,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-28 23:24:14,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-28 23:24:14,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-28 23:24:14,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-28 23:24:14,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-28 23:24:14,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-28 23:24:14,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-28 23:24:14,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-28 23:24:14,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-28 23:24:14,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-28 23:24:14,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-28 23:24:14,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-28 23:24:14,061 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 23:24:14,117 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-28 23:24:14,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-28 23:24:14,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-28 23:24:14,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-28 23:24:14,125 INFO L138 SettingsManager]: * Use SBE=true [2021-04-28 23:24:14,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-28 23:24:14,125 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-28 23:24:14,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-28 23:24:14,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-28 23:24:14,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-28 23:24:14,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-28 23:24:14,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-28 23:24:14,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-28 23:24:14,128 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-28 23:24:14,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-28 23:24:14,129 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-28 23:24:14,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-28 23:24:14,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-28 23:24:14,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-28 23:24:14,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-28 23:24:14,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-28 23:24:14,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-28 23:24:14,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-28 23:24:14,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-28 23:24:14,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-28 23:24:14,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-28 23:24:14,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-28 23:24:14,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-28 23:24:14,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-28 23:24:14,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-28 23:24:14,132 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 23:24:14,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-28 23:24:14,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-28 23:24:14,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-28 23:24:14,577 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-28 23:24:14,577 INFO L275 PluginConnector]: CDTParser initialized [2021-04-28 23:24:14,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2021-04-28 23:24:14,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4e73040/2470b52392024011b4923a6237fe1c8d/FLAG661b652c1 [2021-04-28 23:24:15,538 INFO L306 CDTParser]: Found 1 translation units. [2021-04-28 23:24:15,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2021-04-28 23:24:15,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4e73040/2470b52392024011b4923a6237fe1c8d/FLAG661b652c1 [2021-04-28 23:24:15,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4e73040/2470b52392024011b4923a6237fe1c8d [2021-04-28 23:24:15,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-28 23:24:15,832 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-28 23:24:15,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-28 23:24:15,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-28 23:24:15,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-28 23:24:15,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:24:15" (1/1) ... [2021-04-28 23:24:15,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382d6040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:15, skipping insertion in model container [2021-04-28 23:24:15,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:24:15" (1/1) ... [2021-04-28 23:24:15,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-28 23:24:15,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-28 23:24:16,120 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/safe002_power.opt.i[994,1007] [2021-04-28 23:24:16,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 23:24:16,598 INFO L203 MainTranslator]: Completed pre-run [2021-04-28 23:24:16,618 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/safe002_power.opt.i[994,1007] [2021-04-28 23:24:16,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 23:24:16,928 INFO L208 MainTranslator]: Completed translation [2021-04-28 23:24:16,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16 WrapperNode [2021-04-28 23:24:16,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-28 23:24:16,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-28 23:24:16,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-28 23:24:16,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-28 23:24:16,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:16,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-28 23:24:17,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-28 23:24:17,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-28 23:24:17,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-28 23:24:17,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (1/1) ... [2021-04-28 23:24:17,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-28 23:24:17,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-28 23:24:17,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-28 23:24:17,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-28 23:24:17,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (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 23:24:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-28 23:24:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-28 23:24:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-28 23:24:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-28 23:24:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-28 23:24:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-28 23:24:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-28 23:24:17,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-28 23:24:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-28 23:24:17,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-28 23:24:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-28 23:24:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-28 23:24:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-28 23:24:17,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-28 23:24:17,268 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 23:24:19,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-28 23:24:19,635 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-28 23:24:19,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:24:19 BoogieIcfgContainer [2021-04-28 23:24:19,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-28 23:24:19,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-28 23:24:19,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-28 23:24:19,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-28 23:24:19,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:24:15" (1/3) ... [2021-04-28 23:24:19,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11453c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:24:19, skipping insertion in model container [2021-04-28 23:24:19,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:16" (2/3) ... [2021-04-28 23:24:19,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11453c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:24:19, skipping insertion in model container [2021-04-28 23:24:19,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:24:19" (3/3) ... [2021-04-28 23:24:19,648 INFO L111 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2021-04-28 23:24:19,657 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-28 23:24:19,663 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-28 23:24:19,664 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-28 23:24:19,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,731 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,731 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,751 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 23:24:19,758 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-28 23:24:19,785 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-28 23:24:19,815 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-28 23:24:19,816 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-28 23:24:19,816 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-28 23:24:19,816 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-28 23:24:19,816 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-28 23:24:19,816 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-28 23:24:19,816 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-28 23:24:19,816 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-28 23:24:19,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-04-28 23:24:19,884 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-04-28 23:24:19,885 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:24:19,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-04-28 23:24:19,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-04-28 23:24:19,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-04-28 23:24:19,900 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:24:19,919 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-04-28 23:24:19,924 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-04-28 23:24:19,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-04-28 23:24:19,952 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-04-28 23:24:19,952 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:24:19,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-04-28 23:24:19,958 INFO L146 LiptonReduction]: Number of co-enabled transitions 1586 [2021-04-28 23:24:22,657 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-28 23:24:22,783 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-28 23:24:23,354 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2021-04-28 23:24:23,595 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-04-28 23:24:24,859 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-28 23:24:24,985 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-28 23:24:25,251 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 23:24:25,545 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 23:24:33,264 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-28 23:24:35,183 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-04-28 23:24:37,515 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-28 23:24:38,025 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:38,134 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:38,245 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:38,360 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:38,988 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-28 23:24:39,463 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 23:24:39,575 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 23:24:39,688 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 23:24:39,804 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 23:24:40,240 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 23:24:40,362 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 23:24:40,479 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 23:24:40,596 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 23:24:41,394 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 23:24:41,498 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 23:24:41,606 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 23:24:41,712 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 23:24:41,814 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 23:24:41,915 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 23:24:42,812 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 23:24:42,938 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 23:24:43,061 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 23:24:43,183 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 23:24:44,924 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-28 23:24:45,775 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-28 23:24:45,885 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-28 23:24:45,998 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-28 23:24:46,117 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-28 23:24:46,536 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:46,650 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:46,764 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:46,875 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 23:24:47,001 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 23:24:47,128 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 23:24:47,256 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 23:24:47,380 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 23:24:47,515 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 23:24:47,655 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 23:24:47,823 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 23:24:47,953 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 23:24:48,830 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 23:24:48,978 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 23:24:49,126 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 23:24:49,268 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 23:24:49,448 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:49,618 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:49,789 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:49,961 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:50,122 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 23:24:50,295 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 23:24:50,466 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 23:24:50,637 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 23:24:50,843 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-28 23:24:51,179 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:51,359 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:51,532 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:51,711 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:51,869 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 23:24:52,024 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 23:24:52,181 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 23:24:52,336 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 23:24:52,809 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-04-28 23:24:53,056 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-04-28 23:24:53,524 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-04-28 23:24:53,745 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-04-28 23:24:53,959 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:54,141 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:54,323 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:54,508 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:54,681 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 23:24:54,852 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 23:24:55,028 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 23:24:55,203 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 23:24:55,671 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-04-28 23:24:55,891 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-04-28 23:24:56,342 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-04-28 23:24:56,556 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-04-28 23:24:56,705 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:56,882 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:57,053 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:57,222 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:57,429 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:57,623 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:57,824 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:58,014 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 23:24:58,168 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:58,317 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:58,475 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:58,630 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 23:24:58,802 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 23:24:58,973 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 23:24:59,147 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 23:24:59,314 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 23:24:59,363 INFO L158 LiptonReduction]: Checked pairs total: 15004 [2021-04-28 23:24:59,363 INFO L160 LiptonReduction]: Total number of compositions: 245 [2021-04-28 23:24:59,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39472 [2021-04-28 23:24:59,393 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-04-28 23:24:59,393 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:24:59,394 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:24:59,395 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-28 23:24:59,395 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 23:24:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:24:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1072896661, now seen corresponding path program 1 times [2021-04-28 23:24:59,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:24:59,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796143035] [2021-04-28 23:24:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:24:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:24:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:24:59,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:24:59,781 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 23:24:59,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796143035] [2021-04-28 23:24:59,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:24:59,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 23:24:59,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85095920] [2021-04-28 23:24:59,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 23:24:59,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:24:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 23:24:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 23:24:59,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 342 [2021-04-28 23:24:59,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 120 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 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 23:24:59,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:24:59,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 342 [2021-04-28 23:24:59,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:00,072 INFO L129 PetriNetUnfolder]: 29/237 cut-off events. [2021-04-28 23:25:00,073 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:25:00,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 237 events. 29/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1557 event pairs, 5 based on Foata normal form. 23/104 useless extension candidates. Maximal degree in co-relation 240. Up to 41 conditions per place. [2021-04-28 23:25:00,081 INFO L132 encePairwiseOnDemand]: 325/342 looper letters, 7 selfloop transitions, 2 changer transitions 53/119 dead transitions. [2021-04-28 23:25:00,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 119 transitions, 287 flow [2021-04-28 23:25:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 23:25:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 23:25:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2021-04-28 23:25:00,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8099415204678363 [2021-04-28 23:25:00,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2021-04-28 23:25:00,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2021-04-28 23:25:00,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:00,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2021-04-28 23:25:00,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 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 23:25:00,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:00,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:00,154 INFO L185 Difference]: Start difference. First operand has 129 places, 120 transitions, 249 flow. Second operand 3 states and 831 transitions. [2021-04-28 23:25:00,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 119 transitions, 287 flow [2021-04-28 23:25:00,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 119 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-28 23:25:00,163 INFO L241 Difference]: Finished difference. Result has 125 places, 63 transitions, 136 flow [2021-04-28 23:25:00,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=125, PETRI_TRANSITIONS=63} [2021-04-28 23:25:00,167 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -4 predicate places. [2021-04-28 23:25:00,167 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:00,167 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 63 transitions, 136 flow [2021-04-28 23:25:00,168 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 63 transitions, 136 flow [2021-04-28 23:25:00,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 136 flow [2021-04-28 23:25:00,178 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2021-04-28 23:25:00,178 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:25:00,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 0/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 302 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-28 23:25:00,180 INFO L146 LiptonReduction]: Number of co-enabled transitions 1794 [2021-04-28 23:25:00,994 INFO L158 LiptonReduction]: Checked pairs total: 2176 [2021-04-28 23:25:00,995 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:00,995 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 828 [2021-04-28 23:25:00,997 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 136 flow [2021-04-28 23:25:00,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 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 23:25:00,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:00,998 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:00,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-28 23:25:00,999 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 23:25:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2023409860, now seen corresponding path program 1 times [2021-04-28 23:25:01,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:01,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457233856] [2021-04-28 23:25:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:01,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:01,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:01,154 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 23:25:01,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457233856] [2021-04-28 23:25:01,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:01,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 23:25:01,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194662629] [2021-04-28 23:25:01,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 23:25:01,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 23:25:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 23:25:01,166 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 342 [2021-04-28 23:25:01,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 23:25:01,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:01,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 342 [2021-04-28 23:25:01,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:01,308 INFO L129 PetriNetUnfolder]: 17/97 cut-off events. [2021-04-28 23:25:01,309 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:25:01,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 97 events. 17/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 492 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 155. Up to 39 conditions per place. [2021-04-28 23:25:01,310 INFO L132 encePairwiseOnDemand]: 337/342 looper letters, 1 selfloop transitions, 2 changer transitions 52/80 dead transitions. [2021-04-28 23:25:01,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 80 transitions, 248 flow [2021-04-28 23:25:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 23:25:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 23:25:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2021-04-28 23:25:01,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7173489278752436 [2021-04-28 23:25:01,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2021-04-28 23:25:01,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2021-04-28 23:25:01,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:01,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2021-04-28 23:25:01,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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 23:25:01,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:01,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:01,323 INFO L185 Difference]: Start difference. First operand has 72 places, 63 transitions, 136 flow. Second operand 3 states and 736 transitions. [2021-04-28 23:25:01,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 80 transitions, 248 flow [2021-04-28 23:25:01,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 23:25:01,326 INFO L241 Difference]: Finished difference. Result has 73 places, 28 transitions, 70 flow [2021-04-28 23:25:01,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=73, PETRI_TRANSITIONS=28} [2021-04-28 23:25:01,327 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2021-04-28 23:25:01,327 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:01,327 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 28 transitions, 70 flow [2021-04-28 23:25:01,328 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 28 transitions, 70 flow [2021-04-28 23:25:01,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 70 flow [2021-04-28 23:25:01,334 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-04-28 23:25:01,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 23:25:01,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-28 23:25:01,335 INFO L146 LiptonReduction]: Number of co-enabled transitions 428 [2021-04-28 23:25:01,390 INFO L158 LiptonReduction]: Checked pairs total: 515 [2021-04-28 23:25:01,390 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:01,390 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-04-28 23:25:01,393 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 70 flow [2021-04-28 23:25:01,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 23:25:01,394 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:01,394 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:01,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-28 23:25:01,395 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 23:25:01,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1698802875, now seen corresponding path program 1 times [2021-04-28 23:25:01,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:01,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693850474] [2021-04-28 23:25:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:01,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:01,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:01,489 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 23:25:01,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 23:25:01,505 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 23:25:01,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693850474] [2021-04-28 23:25:01,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:01,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 23:25:01,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526696800] [2021-04-28 23:25:01,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 23:25:01,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 23:25:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 23:25:01,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 342 [2021-04-28 23:25:01,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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 23:25:01,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:01,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 342 [2021-04-28 23:25:01,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:01,583 INFO L129 PetriNetUnfolder]: 26/156 cut-off events. [2021-04-28 23:25:01,584 INFO L130 PetriNetUnfolder]: For 25/33 co-relation queries the response was YES. [2021-04-28 23:25:01,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 156 events. 26/156 cut-off events. For 25/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 862 event pairs, 2 based on Foata normal form. 10/117 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2021-04-28 23:25:01,586 INFO L132 encePairwiseOnDemand]: 335/342 looper letters, 8 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-04-28 23:25:01,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 126 flow [2021-04-28 23:25:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 23:25:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 23:25:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 810 transitions. [2021-04-28 23:25:01,592 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2021-04-28 23:25:01,592 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 810 transitions. [2021-04-28 23:25:01,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 810 transitions. [2021-04-28 23:25:01,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:01,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 810 transitions. [2021-04-28 23:25:01,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 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 23:25:01,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 342.0) internal successors, (1710), 5 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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 23:25:01,604 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 342.0) internal successors, (1710), 5 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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 23:25:01,604 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 70 flow. Second operand 4 states and 810 transitions. [2021-04-28 23:25:01,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 126 flow [2021-04-28 23:25:01,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 23:25:01,607 INFO L241 Difference]: Finished difference. Result has 42 places, 34 transitions, 123 flow [2021-04-28 23:25:01,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2021-04-28 23:25:01,608 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -87 predicate places. [2021-04-28 23:25:01,609 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:01,609 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 123 flow [2021-04-28 23:25:01,610 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 123 flow [2021-04-28 23:25:01,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 123 flow [2021-04-28 23:25:01,634 INFO L129 PetriNetUnfolder]: 17/121 cut-off events. [2021-04-28 23:25:01,634 INFO L130 PetriNetUnfolder]: For 45/59 co-relation queries the response was YES. [2021-04-28 23:25:01,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 121 events. 17/121 cut-off events. For 45/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 644 event pairs, 4 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 213. Up to 33 conditions per place. [2021-04-28 23:25:01,638 INFO L146 LiptonReduction]: Number of co-enabled transitions 526 [2021-04-28 23:25:01,890 INFO L158 LiptonReduction]: Checked pairs total: 343 [2021-04-28 23:25:01,890 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:01,890 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 281 [2021-04-28 23:25:01,892 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 123 flow [2021-04-28 23:25:01,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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 23:25:01,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:01,894 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:01,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-28 23:25:01,894 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 23:25:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1123279397, now seen corresponding path program 1 times [2021-04-28 23:25:01,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:01,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884315858] [2021-04-28 23:25:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:02,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:02,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:02,045 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 23:25:02,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 23:25:02,060 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 23:25:02,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884315858] [2021-04-28 23:25:02,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:02,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 23:25:02,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010723471] [2021-04-28 23:25:02,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 23:25:02,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 23:25:02,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-28 23:25:02,065 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 342 [2021-04-28 23:25:02,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 0 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 23:25:02,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:02,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 342 [2021-04-28 23:25:02,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:02,142 INFO L129 PetriNetUnfolder]: 24/159 cut-off events. [2021-04-28 23:25:02,142 INFO L130 PetriNetUnfolder]: For 89/119 co-relation queries the response was YES. [2021-04-28 23:25:02,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 159 events. 24/159 cut-off events. For 89/119 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 993 event pairs, 2 based on Foata normal form. 10/118 useless extension candidates. Maximal degree in co-relation 329. Up to 36 conditions per place. [2021-04-28 23:25:02,145 INFO L132 encePairwiseOnDemand]: 335/342 looper letters, 9 selfloop transitions, 7 changer transitions 7/43 dead transitions. [2021-04-28 23:25:02,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 210 flow [2021-04-28 23:25:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 23:25:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 23:25:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1009 transitions. [2021-04-28 23:25:02,150 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5900584795321637 [2021-04-28 23:25:02,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1009 transitions. [2021-04-28 23:25:02,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1009 transitions. [2021-04-28 23:25:02,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:02,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1009 transitions. [2021-04-28 23:25:02,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.8) internal successors, (1009), 5 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 23:25:02,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 342.0) internal successors, (2052), 6 states have internal predecessors, (2052), 0 states have call successors, (0), 0 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 23:25:02,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 342.0) internal successors, (2052), 6 states have internal predecessors, (2052), 0 states have call successors, (0), 0 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 23:25:02,163 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 123 flow. Second operand 5 states and 1009 transitions. [2021-04-28 23:25:02,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 210 flow [2021-04-28 23:25:02,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-28 23:25:02,167 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 149 flow [2021-04-28 23:25:02,167 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-04-28 23:25:02,167 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -81 predicate places. [2021-04-28 23:25:02,167 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:02,168 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 149 flow [2021-04-28 23:25:02,168 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 33 transitions, 149 flow [2021-04-28 23:25:02,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 149 flow [2021-04-28 23:25:02,183 INFO L129 PetriNetUnfolder]: 11/72 cut-off events. [2021-04-28 23:25:02,183 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2021-04-28 23:25:02,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 72 events. 11/72 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 278 event pairs, 4 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 162. Up to 22 conditions per place. [2021-04-28 23:25:02,185 INFO L146 LiptonReduction]: Number of co-enabled transitions 444 [2021-04-28 23:25:02,228 INFO L158 LiptonReduction]: Checked pairs total: 298 [2021-04-28 23:25:02,229 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:02,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-04-28 23:25:02,231 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 149 flow [2021-04-28 23:25:02,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 0 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 23:25:02,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:02,233 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:02,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-28 23:25:02,234 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 23:25:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1140926225, now seen corresponding path program 1 times [2021-04-28 23:25:02,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:02,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46161477] [2021-04-28 23:25:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:02,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:02,308 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 23:25:02,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46161477] [2021-04-28 23:25:02,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:02,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 23:25:02,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662097767] [2021-04-28 23:25:02,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 23:25:02,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:02,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 23:25:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 23:25:02,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 342 [2021-04-28 23:25:02,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 23:25:02,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:02,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 342 [2021-04-28 23:25:02,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:02,343 INFO L129 PetriNetUnfolder]: 10/67 cut-off events. [2021-04-28 23:25:02,343 INFO L130 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2021-04-28 23:25:02,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 67 events. 10/67 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 263 event pairs, 3 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 160. Up to 20 conditions per place. [2021-04-28 23:25:02,344 INFO L132 encePairwiseOnDemand]: 339/342 looper letters, 1 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2021-04-28 23:25:02,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 33 transitions, 159 flow [2021-04-28 23:25:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 23:25:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 23:25:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2021-04-28 23:25:02,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6647173489278753 [2021-04-28 23:25:02,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2021-04-28 23:25:02,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2021-04-28 23:25:02,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:02,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2021-04-28 23:25:02,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 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 23:25:02,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:02,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:02,357 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 149 flow. Second operand 3 states and 682 transitions. [2021-04-28 23:25:02,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 33 transitions, 159 flow [2021-04-28 23:25:02,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 142 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-04-28 23:25:02,361 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 144 flow [2021-04-28 23:25:02,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-04-28 23:25:02,362 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -84 predicate places. [2021-04-28 23:25:02,362 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:02,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 144 flow [2021-04-28 23:25:02,362 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 144 flow [2021-04-28 23:25:02,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 144 flow [2021-04-28 23:25:02,375 INFO L129 PetriNetUnfolder]: 10/67 cut-off events. [2021-04-28 23:25:02,375 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-04-28 23:25:02,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 67 events. 10/67 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 259 event pairs, 1 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 143. Up to 20 conditions per place. [2021-04-28 23:25:02,377 INFO L146 LiptonReduction]: Number of co-enabled transitions 406 [2021-04-28 23:25:02,381 INFO L158 LiptonReduction]: Checked pairs total: 304 [2021-04-28 23:25:02,381 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:02,381 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-04-28 23:25:02,383 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 144 flow [2021-04-28 23:25:02,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 23:25:02,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:02,384 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:02,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-28 23:25:02,385 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 23:25:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1140062286, now seen corresponding path program 1 times [2021-04-28 23:25:02,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:02,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461633908] [2021-04-28 23:25:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:02,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 23:25:02,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:02,497 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 23:25:02,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461633908] [2021-04-28 23:25:02,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:02,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 23:25:02,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708277027] [2021-04-28 23:25:02,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 23:25:02,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:02,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 23:25:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 23:25:02,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 342 [2021-04-28 23:25:02,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 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 23:25:02,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:02,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 342 [2021-04-28 23:25:02,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:02,548 INFO L129 PetriNetUnfolder]: 9/63 cut-off events. [2021-04-28 23:25:02,549 INFO L130 PetriNetUnfolder]: For 51/56 co-relation queries the response was YES. [2021-04-28 23:25:02,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 63 events. 9/63 cut-off events. For 51/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 243 event pairs, 3 based on Foata normal form. 3/48 useless extension candidates. Maximal degree in co-relation 151. Up to 17 conditions per place. [2021-04-28 23:25:02,550 INFO L132 encePairwiseOnDemand]: 339/342 looper letters, 7 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-04-28 23:25:02,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 164 flow [2021-04-28 23:25:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 23:25:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 23:25:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2021-04-28 23:25:02,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.776803118908382 [2021-04-28 23:25:02,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2021-04-28 23:25:02,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2021-04-28 23:25:02,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:02,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2021-04-28 23:25:02,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 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 23:25:02,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:02,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 23:25:02,566 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 144 flow. Second operand 3 states and 797 transitions. [2021-04-28 23:25:02,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 164 flow [2021-04-28 23:25:02,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 23:25:02,573 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 147 flow [2021-04-28 23:25:02,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-04-28 23:25:02,573 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -84 predicate places. [2021-04-28 23:25:02,573 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:02,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 147 flow [2021-04-28 23:25:02,574 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 147 flow [2021-04-28 23:25:02,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 147 flow [2021-04-28 23:25:02,595 INFO L129 PetriNetUnfolder]: 9/64 cut-off events. [2021-04-28 23:25:02,595 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-04-28 23:25:02,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 64 events. 9/64 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 240 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 144. Up to 17 conditions per place. [2021-04-28 23:25:02,597 INFO L146 LiptonReduction]: Number of co-enabled transitions 404 [2021-04-28 23:25:02,601 INFO L158 LiptonReduction]: Checked pairs total: 304 [2021-04-28 23:25:02,602 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:02,602 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-04-28 23:25:02,605 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 147 flow [2021-04-28 23:25:02,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 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 23:25:02,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:02,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:02,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-28 23:25:02,606 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 23:25:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1009007504, now seen corresponding path program 1 times [2021-04-28 23:25:02,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:02,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910699342] [2021-04-28 23:25:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:02,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:02,722 INFO L142 QuantifierPusher]: treesize reduction 2, result has 84.6 percent of original size [2021-04-28 23:25:02,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-28 23:25:02,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:02,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 23:25:02,742 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 23:25:02,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910699342] [2021-04-28 23:25:02,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:02,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 23:25:02,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39306434] [2021-04-28 23:25:02,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 23:25:02,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 23:25:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 23:25:02,746 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 342 [2021-04-28 23:25:02,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 0 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 23:25:02,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:02,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 342 [2021-04-28 23:25:02,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:02,959 INFO L129 PetriNetUnfolder]: 644/1151 cut-off events. [2021-04-28 23:25:02,959 INFO L130 PetriNetUnfolder]: For 193/226 co-relation queries the response was YES. [2021-04-28 23:25:02,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 1151 events. 644/1151 cut-off events. For 193/226 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 7571 event pairs, 107 based on Foata normal form. 109/624 useless extension candidates. Maximal degree in co-relation 2411. Up to 661 conditions per place. [2021-04-28 23:25:02,974 INFO L132 encePairwiseOnDemand]: 330/342 looper letters, 20 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2021-04-28 23:25:02,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 247 flow [2021-04-28 23:25:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 23:25:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 23:25:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 897 transitions. [2021-04-28 23:25:02,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6557017543859649 [2021-04-28 23:25:02,980 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 897 transitions. [2021-04-28 23:25:02,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 897 transitions. [2021-04-28 23:25:02,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:02,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 897 transitions. [2021-04-28 23:25:02,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.25) internal successors, (897), 4 states have internal predecessors, (897), 0 states have call successors, (0), 0 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 23:25:02,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 342.0) internal successors, (1710), 5 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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 23:25:02,990 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 342.0) internal successors, (1710), 5 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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 23:25:02,990 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 147 flow. Second operand 4 states and 897 transitions. [2021-04-28 23:25:02,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 247 flow [2021-04-28 23:25:02,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 23:25:02,994 INFO L241 Difference]: Finished difference. Result has 48 places, 42 transitions, 227 flow [2021-04-28 23:25:02,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2021-04-28 23:25:02,995 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -81 predicate places. [2021-04-28 23:25:02,995 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:02,995 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 42 transitions, 227 flow [2021-04-28 23:25:02,995 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 227 flow [2021-04-28 23:25:02,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 227 flow [2021-04-28 23:25:03,105 INFO L129 PetriNetUnfolder]: 420/811 cut-off events. [2021-04-28 23:25:03,105 INFO L130 PetriNetUnfolder]: For 276/327 co-relation queries the response was YES. [2021-04-28 23:25:03,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 811 events. 420/811 cut-off events. For 276/327 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 5673 event pairs, 163 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 1899. Up to 721 conditions per place. [2021-04-28 23:25:03,121 INFO L146 LiptonReduction]: Number of co-enabled transitions 480 [2021-04-28 23:25:03,252 INFO L158 LiptonReduction]: Checked pairs total: 327 [2021-04-28 23:25:03,253 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:03,253 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 258 [2021-04-28 23:25:03,254 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 227 flow [2021-04-28 23:25:03,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 0 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 23:25:03,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:03,255 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:03,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-28 23:25:03,256 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 23:25:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash 966408011, now seen corresponding path program 1 times [2021-04-28 23:25:03,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:03,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801352193] [2021-04-28 23:25:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:03,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:03,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:03,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:03,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:03,364 INFO L142 QuantifierPusher]: treesize reduction 2, result has 84.6 percent of original size [2021-04-28 23:25:03,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-28 23:25:03,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:03,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 23:25:03,386 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 23:25:03,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801352193] [2021-04-28 23:25:03,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:03,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 23:25:03,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316603577] [2021-04-28 23:25:03,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 23:25:03,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 23:25:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 23:25:03,391 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 342 [2021-04-28 23:25:03,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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 23:25:03,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:03,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 342 [2021-04-28 23:25:03,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:03,678 INFO L129 PetriNetUnfolder]: 530/1097 cut-off events. [2021-04-28 23:25:03,678 INFO L130 PetriNetUnfolder]: For 733/1018 co-relation queries the response was YES. [2021-04-28 23:25:03,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1097 events. 530/1097 cut-off events. For 733/1018 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 8039 event pairs, 11 based on Foata normal form. 115/631 useless extension candidates. Maximal degree in co-relation 3637. Up to 886 conditions per place. [2021-04-28 23:25:03,695 INFO L132 encePairwiseOnDemand]: 330/342 looper letters, 21 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2021-04-28 23:25:03,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 386 flow [2021-04-28 23:25:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 23:25:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 23:25:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1123 transitions. [2021-04-28 23:25:03,701 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6567251461988304 [2021-04-28 23:25:03,702 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1123 transitions. [2021-04-28 23:25:03,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1123 transitions. [2021-04-28 23:25:03,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:03,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1123 transitions. [2021-04-28 23:25:03,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.6) internal successors, (1123), 5 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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 23:25:03,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 342.0) internal successors, (2052), 6 states have internal predecessors, (2052), 0 states have call successors, (0), 0 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 23:25:03,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 342.0) internal successors, (2052), 6 states have internal predecessors, (2052), 0 states have call successors, (0), 0 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 23:25:03,715 INFO L185 Difference]: Start difference. First operand has 48 places, 42 transitions, 227 flow. Second operand 5 states and 1123 transitions. [2021-04-28 23:25:03,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 386 flow [2021-04-28 23:25:03,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 23:25:03,722 INFO L241 Difference]: Finished difference. Result has 53 places, 52 transitions, 357 flow [2021-04-28 23:25:03,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2021-04-28 23:25:03,722 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -76 predicate places. [2021-04-28 23:25:03,723 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:03,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 52 transitions, 357 flow [2021-04-28 23:25:03,723 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 52 transitions, 357 flow [2021-04-28 23:25:03,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 52 transitions, 357 flow [2021-04-28 23:25:03,862 INFO L129 PetriNetUnfolder]: 421/935 cut-off events. [2021-04-28 23:25:03,863 INFO L130 PetriNetUnfolder]: For 974/1844 co-relation queries the response was YES. [2021-04-28 23:25:03,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 935 events. 421/935 cut-off events. For 974/1844 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 7322 event pairs, 28 based on Foata normal form. 3/410 useless extension candidates. Maximal degree in co-relation 3448. Up to 778 conditions per place. [2021-04-28 23:25:03,883 INFO L146 LiptonReduction]: Number of co-enabled transitions 484 [2021-04-28 23:25:04,051 INFO L158 LiptonReduction]: Checked pairs total: 489 [2021-04-28 23:25:04,051 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:04,052 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 329 [2021-04-28 23:25:04,053 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 357 flow [2021-04-28 23:25:04,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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 23:25:04,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:04,054 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:04,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-28 23:25:04,054 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 23:25:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1567925545, now seen corresponding path program 1 times [2021-04-28 23:25:04,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:04,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792914942] [2021-04-28 23:25:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:04,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:04,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:04,207 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.5 percent of original size [2021-04-28 23:25:04,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-04-28 23:25:04,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:04,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-28 23:25:04,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:04,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:04,262 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 23:25:04,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792914942] [2021-04-28 23:25:04,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:04,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 23:25:04,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567299931] [2021-04-28 23:25:04,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-28 23:25:04,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-28 23:25:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-28 23:25:04,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 342 [2021-04-28 23:25:04,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 357 flow. Second operand has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 23:25:04,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:04,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 342 [2021-04-28 23:25:04,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:04,835 INFO L129 PetriNetUnfolder]: 890/1900 cut-off events. [2021-04-28 23:25:04,835 INFO L130 PetriNetUnfolder]: For 2562/3221 co-relation queries the response was YES. [2021-04-28 23:25:04,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7234 conditions, 1900 events. 890/1900 cut-off events. For 2562/3221 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 16007 event pairs, 75 based on Foata normal form. 57/947 useless extension candidates. Maximal degree in co-relation 7213. Up to 1573 conditions per place. [2021-04-28 23:25:04,859 INFO L132 encePairwiseOnDemand]: 335/342 looper letters, 8 selfloop transitions, 7 changer transitions 6/64 dead transitions. [2021-04-28 23:25:04,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 463 flow [2021-04-28 23:25:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-28 23:25:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-28 23:25:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1201 transitions. [2021-04-28 23:25:04,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5016708437761069 [2021-04-28 23:25:04,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1201 transitions. [2021-04-28 23:25:04,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1201 transitions. [2021-04-28 23:25:04,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:04,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1201 transitions. [2021-04-28 23:25:04,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.57142857142858) internal successors, (1201), 7 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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 23:25:04,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 342.0) internal successors, (2736), 8 states have internal predecessors, (2736), 0 states have call successors, (0), 0 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 23:25:04,878 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 342.0) internal successors, (2736), 8 states have internal predecessors, (2736), 0 states have call successors, (0), 0 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 23:25:04,878 INFO L185 Difference]: Start difference. First operand has 53 places, 52 transitions, 357 flow. Second operand 7 states and 1201 transitions. [2021-04-28 23:25:04,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 463 flow [2021-04-28 23:25:04,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 433 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-04-28 23:25:04,887 INFO L241 Difference]: Finished difference. Result has 61 places, 57 transitions, 385 flow [2021-04-28 23:25:04,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=385, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2021-04-28 23:25:04,888 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -68 predicate places. [2021-04-28 23:25:04,889 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:04,889 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 57 transitions, 385 flow [2021-04-28 23:25:04,889 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 57 transitions, 385 flow [2021-04-28 23:25:04,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 57 transitions, 385 flow [2021-04-28 23:25:05,112 INFO L129 PetriNetUnfolder]: 550/1297 cut-off events. [2021-04-28 23:25:05,113 INFO L130 PetriNetUnfolder]: For 1629/1795 co-relation queries the response was YES. [2021-04-28 23:25:05,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 1297 events. 550/1297 cut-off events. For 1629/1795 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 10975 event pairs, 28 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 4481. Up to 955 conditions per place. [2021-04-28 23:25:05,147 INFO L146 LiptonReduction]: Number of co-enabled transitions 498 [2021-04-28 23:25:05,451 INFO L158 LiptonReduction]: Checked pairs total: 9 [2021-04-28 23:25:05,451 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 23:25:05,452 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 563 [2021-04-28 23:25:05,453 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 388 flow [2021-04-28 23:25:05,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 23:25:05,454 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:05,454 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:05,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-28 23:25:05,455 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 23:25:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1564005305, now seen corresponding path program 2 times [2021-04-28 23:25:05,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:05,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655462170] [2021-04-28 23:25:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:05,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:05,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:05,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:05,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:05,539 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 23:25:05,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 23:25:05,556 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 23:25:05,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655462170] [2021-04-28 23:25:05,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:05,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 23:25:05,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701007456] [2021-04-28 23:25:05,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 23:25:05,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 23:25:05,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-28 23:25:05,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 343 [2021-04-28 23:25:05,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 388 flow. Second operand has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 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 23:25:05,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:05,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 343 [2021-04-28 23:25:05,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:06,053 INFO L129 PetriNetUnfolder]: 1007/2309 cut-off events. [2021-04-28 23:25:06,054 INFO L130 PetriNetUnfolder]: For 4257/8256 co-relation queries the response was YES. [2021-04-28 23:25:06,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8180 conditions, 2309 events. 1007/2309 cut-off events. For 4257/8256 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 20995 event pairs, 75 based on Foata normal form. 88/1056 useless extension candidates. Maximal degree in co-relation 8155. Up to 1765 conditions per place. [2021-04-28 23:25:06,086 INFO L132 encePairwiseOnDemand]: 336/343 looper letters, 5 selfloop transitions, 8 changer transitions 10/65 dead transitions. [2021-04-28 23:25:06,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 491 flow [2021-04-28 23:25:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 23:25:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 23:25:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1005 transitions. [2021-04-28 23:25:06,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5860058309037901 [2021-04-28 23:25:06,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1005 transitions. [2021-04-28 23:25:06,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1005 transitions. [2021-04-28 23:25:06,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:06,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1005 transitions. [2021-04-28 23:25:06,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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 23:25:06,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 0 states have call successors, (0), 0 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 23:25:06,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 0 states have call successors, (0), 0 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 23:25:06,103 INFO L185 Difference]: Start difference. First operand has 60 places, 57 transitions, 388 flow. Second operand 5 states and 1005 transitions. [2021-04-28 23:25:06,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 491 flow [2021-04-28 23:25:06,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 488 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-04-28 23:25:06,125 INFO L241 Difference]: Finished difference. Result has 64 places, 55 transitions, 398 flow [2021-04-28 23:25:06,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2021-04-28 23:25:06,126 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -65 predicate places. [2021-04-28 23:25:06,126 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:06,126 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 55 transitions, 398 flow [2021-04-28 23:25:06,126 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 55 transitions, 398 flow [2021-04-28 23:25:06,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 55 transitions, 398 flow [2021-04-28 23:25:06,348 INFO L129 PetriNetUnfolder]: 682/1303 cut-off events. [2021-04-28 23:25:06,349 INFO L130 PetriNetUnfolder]: For 1714/1801 co-relation queries the response was YES. [2021-04-28 23:25:06,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 1303 events. 682/1303 cut-off events. For 1714/1801 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 8840 event pairs, 45 based on Foata normal form. 9/609 useless extension candidates. Maximal degree in co-relation 4535. Up to 1018 conditions per place. [2021-04-28 23:25:06,376 INFO L146 LiptonReduction]: Number of co-enabled transitions 416 [2021-04-28 23:25:06,381 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-28 23:25:06,382 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:06,382 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 256 [2021-04-28 23:25:06,383 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 398 flow [2021-04-28 23:25:06,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 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 23:25:06,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:06,384 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 23:25:06,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-28 23:25:06,385 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 23:25:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1041614690, now seen corresponding path program 1 times [2021-04-28 23:25:06,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:06,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145216911] [2021-04-28 23:25:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:06,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:06,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 23:25:06,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:06,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:06,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:06,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:06,468 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 23:25:06,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 23:25:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 23:25:06,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145216911] [2021-04-28 23:25:06,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:06,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 23:25:06,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005935747] [2021-04-28 23:25:06,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 23:25:06,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 23:25:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-28 23:25:06,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 343 [2021-04-28 23:25:06,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 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 23:25:06,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:06,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 343 [2021-04-28 23:25:06,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:06,886 INFO L129 PetriNetUnfolder]: 837/1777 cut-off events. [2021-04-28 23:25:06,886 INFO L130 PetriNetUnfolder]: For 3709/5735 co-relation queries the response was YES. [2021-04-28 23:25:06,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6390 conditions, 1777 events. 837/1777 cut-off events. For 3709/5735 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 14675 event pairs, 73 based on Foata normal form. 74/869 useless extension candidates. Maximal degree in co-relation 6363. Up to 1414 conditions per place. [2021-04-28 23:25:06,912 INFO L132 encePairwiseOnDemand]: 338/343 looper letters, 4 selfloop transitions, 3 changer transitions 8/57 dead transitions. [2021-04-28 23:25:06,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 440 flow [2021-04-28 23:25:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-28 23:25:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-28 23:25:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2021-04-28 23:25:06,920 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5835762876579204 [2021-04-28 23:25:06,921 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1201 transitions. [2021-04-28 23:25:06,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1201 transitions. [2021-04-28 23:25:06,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:06,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1201 transitions. [2021-04-28 23:25:06,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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 23:25:06,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 343.0) internal successors, (2401), 7 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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 23:25:06,936 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 343.0) internal successors, (2401), 7 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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 23:25:06,937 INFO L185 Difference]: Start difference. First operand has 62 places, 55 transitions, 398 flow. Second operand 6 states and 1201 transitions. [2021-04-28 23:25:06,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 440 flow [2021-04-28 23:25:06,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 426 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-04-28 23:25:06,951 INFO L241 Difference]: Finished difference. Result has 64 places, 49 transitions, 329 flow [2021-04-28 23:25:06,951 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2021-04-28 23:25:06,951 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -65 predicate places. [2021-04-28 23:25:06,951 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:06,952 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 49 transitions, 329 flow [2021-04-28 23:25:06,952 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 49 transitions, 329 flow [2021-04-28 23:25:06,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 329 flow [2021-04-28 23:25:07,170 INFO L129 PetriNetUnfolder]: 721/1251 cut-off events. [2021-04-28 23:25:07,170 INFO L130 PetriNetUnfolder]: For 1438/1527 co-relation queries the response was YES. [2021-04-28 23:25:07,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 1251 events. 721/1251 cut-off events. For 1438/1527 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 7740 event pairs, 45 based on Foata normal form. 7/569 useless extension candidates. Maximal degree in co-relation 4245. Up to 1045 conditions per place. [2021-04-28 23:25:07,196 INFO L146 LiptonReduction]: Number of co-enabled transitions 242 [2021-04-28 23:25:07,212 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-28 23:25:07,212 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 23:25:07,212 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 261 [2021-04-28 23:25:07,213 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 329 flow [2021-04-28 23:25:07,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 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 23:25:07,215 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:07,215 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 23:25:07,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-28 23:25:07,216 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 23:25:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1316734241, now seen corresponding path program 1 times [2021-04-28 23:25:07,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:07,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796579568] [2021-04-28 23:25:07,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 23:25:07,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:07,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:07,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:07,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:07,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:07,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 23:25:07,367 INFO L142 QuantifierPusher]: treesize reduction 2, result has 84.6 percent of original size [2021-04-28 23:25:07,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-28 23:25:07,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 23:25:07,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 23:25:07,389 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 23:25:07,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796579568] [2021-04-28 23:25:07,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 23:25:07,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-28 23:25:07,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346106774] [2021-04-28 23:25:07,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-28 23:25:07,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 23:25:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-28 23:25:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-28 23:25:07,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 343 [2021-04-28 23:25:07,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 217.83333333333334) internal successors, (1307), 6 states have internal predecessors, (1307), 0 states have call successors, (0), 0 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 23:25:07,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 23:25:07,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 343 [2021-04-28 23:25:07,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 23:25:07,704 INFO L129 PetriNetUnfolder]: 353/793 cut-off events. [2021-04-28 23:25:07,704 INFO L130 PetriNetUnfolder]: For 1244/1525 co-relation queries the response was YES. [2021-04-28 23:25:07,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 793 events. 353/793 cut-off events. For 1244/1525 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 5798 event pairs, 1 based on Foata normal form. 93/442 useless extension candidates. Maximal degree in co-relation 3322. Up to 622 conditions per place. [2021-04-28 23:25:07,714 INFO L132 encePairwiseOnDemand]: 331/343 looper letters, 4 selfloop transitions, 29 changer transitions 0/48 dead transitions. [2021-04-28 23:25:07,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 384 flow [2021-04-28 23:25:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-28 23:25:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-28 23:25:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1337 transitions. [2021-04-28 23:25:07,721 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6496598639455783 [2021-04-28 23:25:07,722 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1337 transitions. [2021-04-28 23:25:07,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1337 transitions. [2021-04-28 23:25:07,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 23:25:07,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1337 transitions. [2021-04-28 23:25:07,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 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 23:25:07,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 343.0) internal successors, (2401), 7 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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 23:25:07,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 343.0) internal successors, (2401), 7 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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 23:25:07,737 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 329 flow. Second operand 6 states and 1337 transitions. [2021-04-28 23:25:07,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 384 flow [2021-04-28 23:25:07,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 340 flow, removed 8 selfloop flow, removed 15 redundant places. [2021-04-28 23:25:07,745 INFO L241 Difference]: Finished difference. Result has 53 places, 48 transitions, 366 flow [2021-04-28 23:25:07,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2021-04-28 23:25:07,745 INFO L343 CegarLoopForPetriNet]: 129 programPoint places, -76 predicate places. [2021-04-28 23:25:07,746 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 23:25:07,746 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 366 flow [2021-04-28 23:25:07,746 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 366 flow [2021-04-28 23:25:07,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 366 flow [2021-04-28 23:25:07,869 INFO L129 PetriNetUnfolder]: 703/1179 cut-off events. [2021-04-28 23:25:07,870 INFO L130 PetriNetUnfolder]: For 2010/2166 co-relation queries the response was YES. [2021-04-28 23:25:07,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5415 conditions, 1179 events. 703/1179 cut-off events. For 2010/2166 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 7070 event pairs, 0 based on Foata normal form. 2/484 useless extension candidates. Maximal degree in co-relation 5399. Up to 1000 conditions per place. [2021-04-28 23:25:07,885 INFO L146 LiptonReduction]: Number of co-enabled transitions 198 [2021-04-28 23:25:07,956 INFO L158 LiptonReduction]: Checked pairs total: 6 [2021-04-28 23:25:07,956 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 23:25:07,956 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 210 [2021-04-28 23:25:07,958 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 367 flow [2021-04-28 23:25:07,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 217.83333333333334) internal successors, (1307), 6 states have internal predecessors, (1307), 0 states have call successors, (0), 0 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 23:25:07,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 23:25:07,960 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 23:25:07,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-28 23:25:07,960 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 23:25:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 23:25:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1533169336, now seen corresponding path program 1 times [2021-04-28 23:25:07,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 23:25:07,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034047547] [2021-04-28 23:25:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 23:25:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 23:25:08,024 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 23:25:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 23:25:08,092 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 23:25:08,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-28 23:25:08,138 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-28 23:25:08,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-28 23:25:08,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:25:08 BasicIcfg [2021-04-28 23:25:08,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-28 23:25:08,259 INFO L168 Benchmark]: Toolchain (without parser) took 52485.85 ms. Allocated memory was 302.0 MB in the beginning and 843.1 MB in the end (delta: 541.1 MB). Free memory was 277.1 MB in the beginning and 585.9 MB in the end (delta: -308.8 MB). Peak memory consumption was 233.6 MB. Max. memory is 16.0 GB. [2021-04-28 23:25:08,259 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-28 23:25:08,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1096.27 ms. Allocated memory is still 302.0 MB. Free memory was 273.9 MB in the beginning and 277.4 MB in the end (delta: -3.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. [2021-04-28 23:25:08,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.02 ms. Allocated memory is still 302.0 MB. Free memory was 277.4 MB in the beginning and 275.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 23:25:08,260 INFO L168 Benchmark]: Boogie Preprocessor took 74.83 ms. Allocated memory is still 302.0 MB. Free memory was 275.3 MB in the beginning and 273.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 23:25:08,263 INFO L168 Benchmark]: RCFGBuilder took 2506.63 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 273.2 MB in the beginning and 291.3 MB in the end (delta: -18.1 MB). Peak memory consumption was 169.6 MB. Max. memory is 16.0 GB. [2021-04-28 23:25:08,264 INFO L168 Benchmark]: TraceAbstraction took 48614.62 ms. Allocated memory was 362.8 MB in the beginning and 843.1 MB in the end (delta: 480.2 MB). Free memory was 290.3 MB in the beginning and 585.9 MB in the end (delta: -295.6 MB). Peak memory consumption was 183.6 MB. Max. memory is 16.0 GB. [2021-04-28 23:25:08,269 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.34 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1096.27 ms. Allocated memory is still 302.0 MB. Free memory was 273.9 MB in the beginning and 277.4 MB in the end (delta: -3.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 122.02 ms. Allocated memory is still 302.0 MB. Free memory was 277.4 MB in the beginning and 275.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 74.83 ms. Allocated memory is still 302.0 MB. Free memory was 275.3 MB in the beginning and 273.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2506.63 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 273.2 MB in the beginning and 291.3 MB in the end (delta: -18.1 MB). Peak memory consumption was 169.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 48614.62 ms. Allocated memory was 362.8 MB in the beginning and 843.1 MB in the end (delta: 480.2 MB). Free memory was 290.3 MB in the beginning and 585.9 MB in the end (delta: -295.6 MB). Peak memory consumption was 183.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39439.6ms, 102 PlacesBefore, 129 PlacesAfterwards, 94 TransitionsBefore, 120 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 9 FixpointIterations, 160 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 245 TotalNumberOfCompositions, 15004 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4118, positive: 3848, positive conditional: 3848, positive unconditional: 0, negative: 270, negative conditional: 270, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1845, positive: 1785, positive conditional: 0, positive unconditional: 1785, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1845, positive: 1785, positive conditional: 0, positive unconditional: 1785, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1845, positive: 1759, positive conditional: 0, positive unconditional: 1759, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 980, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 878, negative conditional: 0, negative unconditional: 878, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4118, positive: 2063, positive conditional: 2063, positive unconditional: 0, negative: 210, negative conditional: 210, negative unconditional: 0, unknown: 1845, unknown conditional: 1845, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1837, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 57, Negative conditional cache size: 57, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 827.1ms, 125 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1794 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 334, positive: 266, positive conditional: 266, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 801, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 719, negative conditional: 0, negative unconditional: 719, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 334, positive: 186, positive conditional: 186, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 103, unknown conditional: 103, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1940, Positive cache size: 1860, Positive conditional cache size: 1860, Positive unconditional cache size: 0, Negative cache size: 80, Negative conditional cache size: 80, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.3ms, 73 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 45, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1873, Positive conditional cache size: 1873, Positive unconditional cache size: 0, Negative cache size: 83, Negative conditional cache size: 83, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 280.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 343 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 247, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 247, negative conditional: 228, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1971, Positive cache size: 1884, Positive conditional cache size: 1884, Positive unconditional cache size: 0, Negative cache size: 87, Negative conditional cache size: 87, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.2ms, 48 PlacesBefore, 47 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 298 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 6, positive unconditional: 6, 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: 13, positive: 12, positive conditional: 6, positive unconditional: 6, 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: 13, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 40, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1984, Positive cache size: 1896, Positive conditional cache size: 1896, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9ms, 45 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 4, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 4, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1993, Positive cache size: 1905, Positive conditional cache size: 1905, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.8ms, 45 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1996, Positive cache size: 1908, Positive conditional cache size: 1908, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 257.3ms, 48 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 327 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 7, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 7, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 125, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2012, Positive cache size: 1921, Positive conditional cache size: 1921, Positive unconditional cache size: 0, Negative cache size: 91, Negative conditional cache size: 91, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 328.1ms, 53 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 11, 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: 13, positive: 11, positive conditional: 11, 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: 13, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 160, negative conditional: 160, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2025, Positive cache size: 1932, Positive conditional cache size: 1932, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 562.3ms, 61 PlacesBefore, 60 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 1941, Positive conditional cache size: 1941, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 255.3ms, 64 PlacesBefore, 62 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 1941, Positive conditional cache size: 1941, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 260.0ms, 64 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 1941, Positive conditional cache size: 1941, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 209.8ms, 53 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2040, Positive cache size: 1947, Positive conditional cache size: 1947, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 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; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L787] 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) [L787] 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) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 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 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L807] 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) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] 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) [L807] 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) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 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 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 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 [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L4] COND FALSE 0 !(!cond) [L840] 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) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] 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) [L840] 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) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 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 [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 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 [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 48329.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3436.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 39563.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 69 SDslu, 37 SDs, 0 SdLazy, 243 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 574.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 354.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=10, InterpolantAutomatonStates: 54, 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: 49.5ms SsaConstructionTime, 508.1ms SatisfiabilityAnalysisTime, 1123.2ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...