/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:37:37,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:37:37,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:37:37,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:37:37,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:37:37,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:37:37,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:37:37,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:37:37,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:37:37,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:37:37,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:37:37,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:37:37,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:37:37,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:37:37,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:37:37,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:37:37,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:37:37,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:37:37,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:37:37,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:37:37,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:37:37,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:37:37,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:37:37,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:37:37,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:37:37,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:37:37,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:37:37,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:37:37,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:37:37,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:37:37,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:37:37,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:37:37,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:37:37,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:37:37,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:37:37,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:37:37,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:37:37,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:37:37,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:37:37,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:37:37,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:37:37,166 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-RepeatedVariableLbe.epf [2021-03-25 04:37:37,203 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:37:37,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:37:37,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:37:37,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:37:37,206 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:37:37,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:37:37,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:37:37,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:37:37,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:37:37,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:37:37,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:37:37,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:37:37,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:37:37,207 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:37:37,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:37:37,207 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:37:37,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:37:37,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:37:37,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:37:37,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:37:37,209 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:37:37,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:37:37,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:37:37,209 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:37:37,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:37:37,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:37:37,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:37:37,481 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:37:37,481 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:37:37,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc.i [2021-03-25 04:37:37,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab06b3f51/45fe5ff747134d0798e50d112742021a/FLAGf9accd045 [2021-03-25 04:37:37,891 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:37:37,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc.i [2021-03-25 04:37:37,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab06b3f51/45fe5ff747134d0798e50d112742021a/FLAGf9accd045 [2021-03-25 04:37:38,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab06b3f51/45fe5ff747134d0798e50d112742021a [2021-03-25 04:37:38,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:37:38,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:37:38,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:37:38,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:37:38,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:37:38,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e323ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38, skipping insertion in model container [2021-03-25 04:37:38,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:37:38,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:37:38,402 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/mix023_power.oepc.i[951,964] [2021-03-25 04:37:38,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:37:38,591 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:37:38,597 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/mix023_power.oepc.i[951,964] [2021-03-25 04:37:38,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:37:38,657 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:37:38,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38 WrapperNode [2021-03-25 04:37:38,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:37:38,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:37:38,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:37:38,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:37:38,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:37:38,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:37:38,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:37:38,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:37:38,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... [2021-03-25 04:37:38,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:37:38,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:37:38,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:37:38,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:37:38,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:37:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:37:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:37:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:37:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:37:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:37:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:37:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:37:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:37:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:37:38,763 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:37:40,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:37:40,238 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:37:40,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:37:40 BoogieIcfgContainer [2021-03-25 04:37:40,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:37:40,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:37:40,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:37:40,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:37:40,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:37:38" (1/3) ... [2021-03-25 04:37:40,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a99b77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:37:40, skipping insertion in model container [2021-03-25 04:37:40,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:37:38" (2/3) ... [2021-03-25 04:37:40,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a99b77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:37:40, skipping insertion in model container [2021-03-25 04:37:40,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:37:40" (3/3) ... [2021-03-25 04:37:40,245 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc.i [2021-03-25 04:37:40,250 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:37:40,252 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:37:40,253 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:37:40,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,293 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,294 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,294 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,316 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,316 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:37:40,323 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:37:40,334 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:37:40,345 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:37:40,346 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:37:40,346 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:37:40,346 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:37:40,346 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:37:40,346 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:37:40,346 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:37:40,346 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:37:40,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-25 04:37:40,398 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-25 04:37:40,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:37:40,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:37:40,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-25 04:37:40,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-25 04:37:40,412 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:40,419 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-25 04:37:40,422 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-25 04:37:40,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-25 04:37:40,448 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-25 04:37:40,449 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:37:40,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:37:40,453 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-25 04:37:41,316 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:37:41,671 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-25 04:37:41,806 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:37:42,600 INFO L154 LiptonReduction]: Checked pairs total: 5866 [2021-03-25 04:37:42,600 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 04:37:42,602 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2190 [2021-03-25 04:37:42,607 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 04:37:42,607 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:37:42,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:42,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:42,607 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1838731669, now seen corresponding path program 1 times [2021-03-25 04:37:42,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:42,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274091466] [2021-03-25 04:37:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:42,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:42,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:42,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:42,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:42,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274091466] [2021-03-25 04:37:42,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:42,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:37:42,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73104766] [2021-03-25 04:37:42,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:37:42,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:37:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:37:42,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 193 [2021-03-25 04:37:42,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:42,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:42,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 193 [2021-03-25 04:37:42,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:42,879 INFO L129 PetriNetUnfolder]: 133/299 cut-off events. [2021-03-25 04:37:42,879 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:37:42,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 299 events. 133/299 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1420 event pairs, 110 based on Foata normal form. 32/316 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-25 04:37:42,883 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-25 04:37:42,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-25 04:37:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:37:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:37:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-03-25 04:37:42,896 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084628670120898 [2021-03-25 04:37:42,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-03-25 04:37:42,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-03-25 04:37:42,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:42,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-03-25 04:37:42,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:42,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:42,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:42,909 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 526 transitions. [2021-03-25 04:37:42,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-25 04:37:42,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:37:42,914 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-25 04:37:42,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-25 04:37:42,916 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-25 04:37:42,916 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:42,916 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 04:37:42,917 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 04:37:42,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-25 04:37:42,921 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-25 04:37:42,921 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:37:42,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:37:42,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-25 04:37:43,237 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:37:43,357 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:37:44,066 INFO L154 LiptonReduction]: Checked pairs total: 2944 [2021-03-25 04:37:44,066 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 04:37:44,066 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1150 [2021-03-25 04:37:44,067 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-03-25 04:37:44,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:44,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:44,067 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:44,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:37:44,067 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:44,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1536669456, now seen corresponding path program 1 times [2021-03-25 04:37:44,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:44,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249286840] [2021-03-25 04:37:44,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:44,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:44,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:44,143 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:37:44,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:37:44,153 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:37:44,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:37:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:44,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249286840] [2021-03-25 04:37:44,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:44,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:37:44,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407140818] [2021-03-25 04:37:44,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:37:44,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:44,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:37:44,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:37:44,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 207 [2021-03-25 04:37:44,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:44,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:44,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 207 [2021-03-25 04:37:44,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:44,335 INFO L129 PetriNetUnfolder]: 640/1307 cut-off events. [2021-03-25 04:37:44,335 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:37:44,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 1307 events. 640/1307 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8769 event pairs, 135 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 2287. Up to 377 conditions per place. [2021-03-25 04:37:44,342 INFO L132 encePairwiseOnDemand]: 196/207 looper letters, 10 selfloop transitions, 9 changer transitions 18/57 dead transitions. [2021-03-25 04:37:44,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 200 flow [2021-03-25 04:37:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:37:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:37:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2021-03-25 04:37:44,345 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8048309178743961 [2021-03-25 04:37:44,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2021-03-25 04:37:44,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2021-03-25 04:37:44,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:44,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2021-03-25 04:37:44,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:44,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:44,349 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:44,349 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 833 transitions. [2021-03-25 04:37:44,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 200 flow [2021-03-25 04:37:44,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:37:44,350 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 156 flow [2021-03-25 04:37:44,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-25 04:37:44,351 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -12 predicate places. [2021-03-25 04:37:44,351 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:44,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 156 flow [2021-03-25 04:37:44,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 156 flow [2021-03-25 04:37:44,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 156 flow [2021-03-25 04:37:44,409 INFO L129 PetriNetUnfolder]: 347/864 cut-off events. [2021-03-25 04:37:44,409 INFO L130 PetriNetUnfolder]: For 266/298 co-relation queries the response was YES. [2021-03-25 04:37:44,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 864 events. 347/864 cut-off events. For 266/298 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6225 event pairs, 133 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1926. Up to 377 conditions per place. [2021-03-25 04:37:44,416 INFO L142 LiptonReduction]: Number of co-enabled transitions 578 [2021-03-25 04:37:45,274 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:37:45,422 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:37:45,728 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:37:45,865 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:37:46,004 INFO L154 LiptonReduction]: Checked pairs total: 1002 [2021-03-25 04:37:46,004 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:37:46,004 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1653 [2021-03-25 04:37:46,004 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 152 flow [2021-03-25 04:37:46,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:46,005 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:46,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:37:46,005 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 282163637, now seen corresponding path program 1 times [2021-03-25 04:37:46,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:46,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519107236] [2021-03-25 04:37:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:46,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:46,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:46,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:46,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:46,061 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:37:46,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:37:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:46,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519107236] [2021-03-25 04:37:46,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:46,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:37:46,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298275593] [2021-03-25 04:37:46,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:37:46,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:37:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:37:46,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 209 [2021-03-25 04:37:46,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:46,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 209 [2021-03-25 04:37:46,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:46,169 INFO L129 PetriNetUnfolder]: 318/777 cut-off events. [2021-03-25 04:37:46,169 INFO L130 PetriNetUnfolder]: For 283/632 co-relation queries the response was YES. [2021-03-25 04:37:46,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 777 events. 318/777 cut-off events. For 283/632 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5115 event pairs, 32 based on Foata normal form. 3/764 useless extension candidates. Maximal degree in co-relation 2284. Up to 351 conditions per place. [2021-03-25 04:37:46,174 INFO L132 encePairwiseOnDemand]: 199/209 looper letters, 16 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2021-03-25 04:37:46,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 276 flow [2021-03-25 04:37:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:37:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:37:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2021-03-25 04:37:46,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8098086124401914 [2021-03-25 04:37:46,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2021-03-25 04:37:46,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2021-03-25 04:37:46,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:46,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2021-03-25 04:37:46,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,179 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 152 flow. Second operand 4 states and 677 transitions. [2021-03-25 04:37:46,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 276 flow [2021-03-25 04:37:46,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 220 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-25 04:37:46,185 INFO L241 Difference]: Finished difference. Result has 46 places, 45 transitions, 216 flow [2021-03-25 04:37:46,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2021-03-25 04:37:46,186 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -15 predicate places. [2021-03-25 04:37:46,186 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:46,186 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 216 flow [2021-03-25 04:37:46,186 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 216 flow [2021-03-25 04:37:46,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 216 flow [2021-03-25 04:37:46,266 INFO L129 PetriNetUnfolder]: 318/779 cut-off events. [2021-03-25 04:37:46,266 INFO L130 PetriNetUnfolder]: For 472/540 co-relation queries the response was YES. [2021-03-25 04:37:46,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 779 events. 318/779 cut-off events. For 472/540 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5485 event pairs, 120 based on Foata normal form. 1/767 useless extension candidates. Maximal degree in co-relation 1889. Up to 351 conditions per place. [2021-03-25 04:37:46,272 INFO L142 LiptonReduction]: Number of co-enabled transitions 690 [2021-03-25 04:37:46,343 INFO L154 LiptonReduction]: Checked pairs total: 472 [2021-03-25 04:37:46,343 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:37:46,343 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 157 [2021-03-25 04:37:46,344 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 216 flow [2021-03-25 04:37:46,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:46,344 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:46,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:37:46,345 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:46,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1344964022, now seen corresponding path program 1 times [2021-03-25 04:37:46,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:46,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128475417] [2021-03-25 04:37:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:46,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:46,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:46,404 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:37:46,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:37:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:46,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128475417] [2021-03-25 04:37:46,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:46,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:37:46,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228867753] [2021-03-25 04:37:46,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:37:46,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:37:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:37:46,421 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 209 [2021-03-25 04:37:46,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:46,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 209 [2021-03-25 04:37:46,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:46,509 INFO L129 PetriNetUnfolder]: 289/736 cut-off events. [2021-03-25 04:37:46,509 INFO L130 PetriNetUnfolder]: For 548/995 co-relation queries the response was YES. [2021-03-25 04:37:46,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 736 events. 289/736 cut-off events. For 548/995 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4978 event pairs, 76 based on Foata normal form. 17/741 useless extension candidates. Maximal degree in co-relation 2236. Up to 325 conditions per place. [2021-03-25 04:37:46,514 INFO L132 encePairwiseOnDemand]: 199/209 looper letters, 19 selfloop transitions, 20 changer transitions 0/58 dead transitions. [2021-03-25 04:37:46,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 380 flow [2021-03-25 04:37:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:37:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:37:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2021-03-25 04:37:46,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8098086124401914 [2021-03-25 04:37:46,516 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2021-03-25 04:37:46,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2021-03-25 04:37:46,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:46,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2021-03-25 04:37:46,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,519 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,519 INFO L185 Difference]: Start difference. First operand has 46 places, 45 transitions, 216 flow. Second operand 4 states and 677 transitions. [2021-03-25 04:37:46,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 380 flow [2021-03-25 04:37:46,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:37:46,523 INFO L241 Difference]: Finished difference. Result has 52 places, 55 transitions, 382 flow [2021-03-25 04:37:46,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2021-03-25 04:37:46,524 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-25 04:37:46,524 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:46,524 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 382 flow [2021-03-25 04:37:46,524 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 382 flow [2021-03-25 04:37:46,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 382 flow [2021-03-25 04:37:46,582 INFO L129 PetriNetUnfolder]: 289/752 cut-off events. [2021-03-25 04:37:46,582 INFO L130 PetriNetUnfolder]: For 1245/1367 co-relation queries the response was YES. [2021-03-25 04:37:46,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 752 events. 289/752 cut-off events. For 1245/1367 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5280 event pairs, 82 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 2314. Up to 325 conditions per place. [2021-03-25 04:37:46,588 INFO L142 LiptonReduction]: Number of co-enabled transitions 810 [2021-03-25 04:37:46,690 INFO L154 LiptonReduction]: Checked pairs total: 772 [2021-03-25 04:37:46,691 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:37:46,691 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 167 [2021-03-25 04:37:46,691 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 382 flow [2021-03-25 04:37:46,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:46,692 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:46,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:37:46,692 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:46,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1229725006, now seen corresponding path program 1 times [2021-03-25 04:37:46,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:46,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646603941] [2021-03-25 04:37:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:46,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:46,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:46,747 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:37:46,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:37:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:46,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646603941] [2021-03-25 04:37:46,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:46,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:37:46,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003749869] [2021-03-25 04:37:46,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:37:46,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:37:46,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:37:46,758 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 209 [2021-03-25 04:37:46,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 382 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:46,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 209 [2021-03-25 04:37:46,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:46,824 INFO L129 PetriNetUnfolder]: 224/576 cut-off events. [2021-03-25 04:37:46,824 INFO L130 PetriNetUnfolder]: For 1340/1873 co-relation queries the response was YES. [2021-03-25 04:37:46,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 576 events. 224/576 cut-off events. For 1340/1873 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3502 event pairs, 23 based on Foata normal form. 21/586 useless extension candidates. Maximal degree in co-relation 2214. Up to 249 conditions per place. [2021-03-25 04:37:46,828 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 37 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2021-03-25 04:37:46,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 620 flow [2021-03-25 04:37:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:37:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:37:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-25 04:37:46,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.80622009569378 [2021-03-25 04:37:46,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-25 04:37:46,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-25 04:37:46,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:46,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-25 04:37:46,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,833 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,833 INFO L185 Difference]: Start difference. First operand has 52 places, 55 transitions, 382 flow. Second operand 4 states and 674 transitions. [2021-03-25 04:37:46,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 620 flow [2021-03-25 04:37:46,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:37:46,838 INFO L241 Difference]: Finished difference. Result has 58 places, 63 transitions, 550 flow [2021-03-25 04:37:46,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=550, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2021-03-25 04:37:46,839 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2021-03-25 04:37:46,839 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:46,839 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 550 flow [2021-03-25 04:37:46,839 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 550 flow [2021-03-25 04:37:46,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 550 flow [2021-03-25 04:37:46,887 INFO L129 PetriNetUnfolder]: 224/618 cut-off events. [2021-03-25 04:37:46,887 INFO L130 PetriNetUnfolder]: For 1776/1874 co-relation queries the response was YES. [2021-03-25 04:37:46,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2240 conditions, 618 events. 224/618 cut-off events. For 1776/1874 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4082 event pairs, 44 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 2218. Up to 249 conditions per place. [2021-03-25 04:37:46,894 INFO L142 LiptonReduction]: Number of co-enabled transitions 910 [2021-03-25 04:37:46,955 INFO L154 LiptonReduction]: Checked pairs total: 1019 [2021-03-25 04:37:46,955 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:37:46,955 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-03-25 04:37:46,958 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 550 flow [2021-03-25 04:37:46,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:46,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:46,958 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:46,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:37:46,958 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash 470513013, now seen corresponding path program 1 times [2021-03-25 04:37:46,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:46,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059385993] [2021-03-25 04:37:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:47,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:47,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:47,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059385993] [2021-03-25 04:37:47,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:47,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:37:47,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602463175] [2021-03-25 04:37:47,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:37:47,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:37:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:37:47,012 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 209 [2021-03-25 04:37:47,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:47,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 209 [2021-03-25 04:37:47,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:47,055 INFO L129 PetriNetUnfolder]: 188/504 cut-off events. [2021-03-25 04:37:47,055 INFO L130 PetriNetUnfolder]: For 1789/1892 co-relation queries the response was YES. [2021-03-25 04:37:47,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 504 events. 188/504 cut-off events. For 1789/1892 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3010 event pairs, 41 based on Foata normal form. 16/509 useless extension candidates. Maximal degree in co-relation 1916. Up to 207 conditions per place. [2021-03-25 04:37:47,058 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 1 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2021-03-25 04:37:47,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 562 flow [2021-03-25 04:37:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:37:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:37:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-25 04:37:47,060 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9011164274322169 [2021-03-25 04:37:47,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-25 04:37:47,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-25 04:37:47,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:47,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-25 04:37:47,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,062 INFO L185 Difference]: Start difference. First operand has 58 places, 63 transitions, 550 flow. Second operand 3 states and 565 transitions. [2021-03-25 04:37:47,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 562 flow [2021-03-25 04:37:47,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:37:47,069 INFO L241 Difference]: Finished difference. Result has 60 places, 63 transitions, 563 flow [2021-03-25 04:37:47,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2021-03-25 04:37:47,069 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2021-03-25 04:37:47,069 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:47,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 563 flow [2021-03-25 04:37:47,069 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 63 transitions, 563 flow [2021-03-25 04:37:47,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 63 transitions, 563 flow [2021-03-25 04:37:47,136 INFO L129 PetriNetUnfolder]: 188/528 cut-off events. [2021-03-25 04:37:47,137 INFO L130 PetriNetUnfolder]: For 1569/1667 co-relation queries the response was YES. [2021-03-25 04:37:47,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 528 events. 188/528 cut-off events. For 1569/1667 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3336 event pairs, 35 based on Foata normal form. 2/519 useless extension candidates. Maximal degree in co-relation 1968. Up to 207 conditions per place. [2021-03-25 04:37:47,142 INFO L142 LiptonReduction]: Number of co-enabled transitions 910 [2021-03-25 04:37:47,173 INFO L154 LiptonReduction]: Checked pairs total: 863 [2021-03-25 04:37:47,173 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:37:47,173 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-25 04:37:47,175 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 563 flow [2021-03-25 04:37:47,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,175 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:47,175 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:47,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:37:47,175 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1501377993, now seen corresponding path program 1 times [2021-03-25 04:37:47,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:47,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213548249] [2021-03-25 04:37:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:47,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:47,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:47,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:47,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:37:47,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:47,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:47,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213548249] [2021-03-25 04:37:47,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:47,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:37:47,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846649866] [2021-03-25 04:37:47,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:37:47,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:37:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:37:47,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:37:47,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 563 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:47,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:37:47,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:47,397 INFO L129 PetriNetUnfolder]: 903/1895 cut-off events. [2021-03-25 04:37:47,398 INFO L130 PetriNetUnfolder]: For 2480/2707 co-relation queries the response was YES. [2021-03-25 04:37:47,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5130 conditions, 1895 events. 903/1895 cut-off events. For 2480/2707 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 15294 event pairs, 369 based on Foata normal form. 167/1900 useless extension candidates. Maximal degree in co-relation 5104. Up to 1083 conditions per place. [2021-03-25 04:37:47,414 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2021-03-25 04:37:47,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 629 flow [2021-03-25 04:37:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:37:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:37:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 907 transitions. [2021-03-25 04:37:47,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8679425837320575 [2021-03-25 04:37:47,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 907 transitions. [2021-03-25 04:37:47,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 907 transitions. [2021-03-25 04:37:47,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:47,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 907 transitions. [2021-03-25 04:37:47,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:47,419 INFO L185 Difference]: Start difference. First operand has 60 places, 63 transitions, 563 flow. Second operand 5 states and 907 transitions. [2021-03-25 04:37:47,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 629 flow [2021-03-25 04:37:47,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:37:47,427 INFO L241 Difference]: Finished difference. Result has 65 places, 72 transitions, 628 flow [2021-03-25 04:37:47,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=628, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2021-03-25 04:37:47,427 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2021-03-25 04:37:47,428 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:47,428 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 72 transitions, 628 flow [2021-03-25 04:37:47,428 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 72 transitions, 628 flow [2021-03-25 04:37:47,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 72 transitions, 628 flow [2021-03-25 04:37:47,547 INFO L129 PetriNetUnfolder]: 945/1995 cut-off events. [2021-03-25 04:37:47,548 INFO L130 PetriNetUnfolder]: For 3471/3919 co-relation queries the response was YES. [2021-03-25 04:37:47,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6584 conditions, 1995 events. 945/1995 cut-off events. For 3471/3919 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 16764 event pairs, 374 based on Foata normal form. 25/1845 useless extension candidates. Maximal degree in co-relation 6557. Up to 1192 conditions per place. [2021-03-25 04:37:47,576 INFO L142 LiptonReduction]: Number of co-enabled transitions 1374 [2021-03-25 04:37:48,441 INFO L154 LiptonReduction]: Checked pairs total: 2217 [2021-03-25 04:37:48,442 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:37:48,442 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1014 [2021-03-25 04:37:48,442 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 622 flow [2021-03-25 04:37:48,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:48,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:48,442 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:48,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:37:48,443 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash 463221781, now seen corresponding path program 1 times [2021-03-25 04:37:48,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:48,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519050717] [2021-03-25 04:37:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:48,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:48,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:48,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:48,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:48,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:48,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:37:48,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:48,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:48,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519050717] [2021-03-25 04:37:48,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:48,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:37:48,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660560760] [2021-03-25 04:37:48,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:37:48,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:37:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:37:48,504 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:37:48,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 622 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:48,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:48,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:37:48,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:48,632 INFO L129 PetriNetUnfolder]: 559/1326 cut-off events. [2021-03-25 04:37:48,632 INFO L130 PetriNetUnfolder]: For 2810/3655 co-relation queries the response was YES. [2021-03-25 04:37:48,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5309 conditions, 1326 events. 559/1326 cut-off events. For 2810/3655 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 10107 event pairs, 101 based on Foata normal form. 306/1574 useless extension candidates. Maximal degree in co-relation 5280. Up to 816 conditions per place. [2021-03-25 04:37:48,643 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2021-03-25 04:37:48,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 80 transitions, 722 flow [2021-03-25 04:37:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:37:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:37:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1088 transitions. [2021-03-25 04:37:48,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8676236044657097 [2021-03-25 04:37:48,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1088 transitions. [2021-03-25 04:37:48,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1088 transitions. [2021-03-25 04:37:48,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:48,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1088 transitions. [2021-03-25 04:37:48,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:48,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:48,650 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:48,650 INFO L185 Difference]: Start difference. First operand has 65 places, 71 transitions, 622 flow. Second operand 6 states and 1088 transitions. [2021-03-25 04:37:48,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 80 transitions, 722 flow [2021-03-25 04:37:48,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 715 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:37:48,659 INFO L241 Difference]: Finished difference. Result has 69 places, 76 transitions, 711 flow [2021-03-25 04:37:48,659 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=69, PETRI_TRANSITIONS=76} [2021-03-25 04:37:48,659 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2021-03-25 04:37:48,659 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:48,659 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 76 transitions, 711 flow [2021-03-25 04:37:48,660 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 76 transitions, 711 flow [2021-03-25 04:37:48,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 76 transitions, 711 flow [2021-03-25 04:37:48,743 INFO L129 PetriNetUnfolder]: 575/1374 cut-off events. [2021-03-25 04:37:48,743 INFO L130 PetriNetUnfolder]: For 4246/4847 co-relation queries the response was YES. [2021-03-25 04:37:48,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 1374 events. 575/1374 cut-off events. For 4246/4847 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 10813 event pairs, 93 based on Foata normal form. 54/1369 useless extension candidates. Maximal degree in co-relation 6054. Up to 861 conditions per place. [2021-03-25 04:37:48,761 INFO L142 LiptonReduction]: Number of co-enabled transitions 1452 [2021-03-25 04:37:49,369 INFO L154 LiptonReduction]: Checked pairs total: 2214 [2021-03-25 04:37:49,369 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:37:49,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 710 [2021-03-25 04:37:49,370 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 703 flow [2021-03-25 04:37:49,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:49,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:49,370 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:49,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:37:49,370 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1687331063, now seen corresponding path program 1 times [2021-03-25 04:37:49,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:49,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988452980] [2021-03-25 04:37:49,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:49,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:49,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:49,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:49,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:49,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:49,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:49,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:49,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:37:49,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:49,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:49,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988452980] [2021-03-25 04:37:49,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:49,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:37:49,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325369600] [2021-03-25 04:37:49,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:37:49,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:37:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:37:49,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:37:49,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:49,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:49,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:37:49,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:49,566 INFO L129 PetriNetUnfolder]: 332/837 cut-off events. [2021-03-25 04:37:49,566 INFO L130 PetriNetUnfolder]: For 3125/3845 co-relation queries the response was YES. [2021-03-25 04:37:49,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 837 events. 332/837 cut-off events. For 3125/3845 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5562 event pairs, 32 based on Foata normal form. 309/1115 useless extension candidates. Maximal degree in co-relation 4068. Up to 461 conditions per place. [2021-03-25 04:37:49,574 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 18 changer transitions 4/84 dead transitions. [2021-03-25 04:37:49,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 845 flow [2021-03-25 04:37:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:37:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:37:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1269 transitions. [2021-03-25 04:37:49,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8673957621326043 [2021-03-25 04:37:49,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1269 transitions. [2021-03-25 04:37:49,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1269 transitions. [2021-03-25 04:37:49,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:49,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1269 transitions. [2021-03-25 04:37:49,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 181.28571428571428) internal successors, (1269), 7 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:49,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:49,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:49,583 INFO L185 Difference]: Start difference. First operand has 69 places, 75 transitions, 703 flow. Second operand 7 states and 1269 transitions. [2021-03-25 04:37:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 845 flow [2021-03-25 04:37:49,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 783 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 04:37:49,622 INFO L241 Difference]: Finished difference. Result has 72 places, 80 transitions, 763 flow [2021-03-25 04:37:49,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=763, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2021-03-25 04:37:49,622 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2021-03-25 04:37:49,622 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:49,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 80 transitions, 763 flow [2021-03-25 04:37:49,622 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 80 transitions, 763 flow [2021-03-25 04:37:49,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 80 transitions, 763 flow [2021-03-25 04:37:49,686 INFO L129 PetriNetUnfolder]: 333/856 cut-off events. [2021-03-25 04:37:49,686 INFO L130 PetriNetUnfolder]: For 2480/2643 co-relation queries the response was YES. [2021-03-25 04:37:49,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 856 events. 333/856 cut-off events. For 2480/2643 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5949 event pairs, 25 based on Foata normal form. 3/825 useless extension candidates. Maximal degree in co-relation 3732. Up to 400 conditions per place. [2021-03-25 04:37:49,697 INFO L142 LiptonReduction]: Number of co-enabled transitions 1328 [2021-03-25 04:37:49,875 INFO L154 LiptonReduction]: Checked pairs total: 2667 [2021-03-25 04:37:49,875 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:37:49,875 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 253 [2021-03-25 04:37:49,876 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 753 flow [2021-03-25 04:37:49,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:49,876 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:49,876 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:49,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:37:49,876 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1044948303, now seen corresponding path program 1 times [2021-03-25 04:37:49,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:49,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491589367] [2021-03-25 04:37:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:49,950 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 04:37:49,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 04:37:49,971 INFO L142 QuantifierPusher]: treesize reduction 5, result has 92.4 percent of original size [2021-03-25 04:37:49,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-25 04:37:50,008 INFO L142 QuantifierPusher]: treesize reduction 29, result has 72.1 percent of original size [2021-03-25 04:37:50,010 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.0 percent of original size 66 [2021-03-25 04:37:50,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:50,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:37:50,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:50,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:50,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491589367] [2021-03-25 04:37:50,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:50,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:37:50,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079508601] [2021-03-25 04:37:50,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:37:50,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:50,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:37:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:37:50,061 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 209 [2021-03-25 04:37:50,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 753 flow. Second operand has 7 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:50,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:50,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 209 [2021-03-25 04:37:50,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:50,438 INFO L129 PetriNetUnfolder]: 1105/2509 cut-off events. [2021-03-25 04:37:50,438 INFO L130 PetriNetUnfolder]: For 7375/7789 co-relation queries the response was YES. [2021-03-25 04:37:50,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9740 conditions, 2509 events. 1105/2509 cut-off events. For 7375/7789 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20270 event pairs, 97 based on Foata normal form. 19/2363 useless extension candidates. Maximal degree in co-relation 9707. Up to 883 conditions per place. [2021-03-25 04:37:50,457 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 31 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2021-03-25 04:37:50,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 961 flow [2021-03-25 04:37:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:37:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:37:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 944 transitions. [2021-03-25 04:37:50,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7527910685805422 [2021-03-25 04:37:50,459 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 944 transitions. [2021-03-25 04:37:50,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 944 transitions. [2021-03-25 04:37:50,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:50,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 944 transitions. [2021-03-25 04:37:50,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.33333333333334) internal successors, (944), 6 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:50,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:50,462 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:50,463 INFO L185 Difference]: Start difference. First operand has 72 places, 79 transitions, 753 flow. Second operand 6 states and 944 transitions. [2021-03-25 04:37:50,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 961 flow [2021-03-25 04:37:50,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 904 flow, removed 22 selfloop flow, removed 4 redundant places. [2021-03-25 04:37:50,543 INFO L241 Difference]: Finished difference. Result has 74 places, 80 transitions, 727 flow [2021-03-25 04:37:50,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=727, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2021-03-25 04:37:50,543 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2021-03-25 04:37:50,543 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:50,543 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 80 transitions, 727 flow [2021-03-25 04:37:50,543 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 80 transitions, 727 flow [2021-03-25 04:37:50,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 80 transitions, 727 flow [2021-03-25 04:37:50,633 INFO L129 PetriNetUnfolder]: 612/1507 cut-off events. [2021-03-25 04:37:50,634 INFO L130 PetriNetUnfolder]: For 3429/3551 co-relation queries the response was YES. [2021-03-25 04:37:50,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 1507 events. 612/1507 cut-off events. For 3429/3551 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11412 event pairs, 71 based on Foata normal form. 7/1406 useless extension candidates. Maximal degree in co-relation 5569. Up to 489 conditions per place. [2021-03-25 04:37:50,648 INFO L142 LiptonReduction]: Number of co-enabled transitions 1288 [2021-03-25 04:37:50,995 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:37:51,129 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:37:51,219 INFO L154 LiptonReduction]: Checked pairs total: 1207 [2021-03-25 04:37:51,220 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:37:51,220 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 677 [2021-03-25 04:37:51,220 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 733 flow [2021-03-25 04:37:51,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:51,220 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:51,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:37:51,220 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash -371859865, now seen corresponding path program 1 times [2021-03-25 04:37:51,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:51,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039854316] [2021-03-25 04:37:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:51,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:51,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:51,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039854316] [2021-03-25 04:37:51,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:51,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:37:51,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543562411] [2021-03-25 04:37:51,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:37:51,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:37:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:37:51,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 210 [2021-03-25 04:37:51,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:51,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 210 [2021-03-25 04:37:51,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:51,466 INFO L129 PetriNetUnfolder]: 988/2326 cut-off events. [2021-03-25 04:37:51,466 INFO L130 PetriNetUnfolder]: For 6157/6402 co-relation queries the response was YES. [2021-03-25 04:37:51,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 2326 events. 988/2326 cut-off events. For 6157/6402 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 19149 event pairs, 101 based on Foata normal form. 53/2206 useless extension candidates. Maximal degree in co-relation 8659. Up to 831 conditions per place. [2021-03-25 04:37:51,478 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 10 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2021-03-25 04:37:51,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 795 flow [2021-03-25 04:37:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:37:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:37:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2021-03-25 04:37:51,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8841269841269841 [2021-03-25 04:37:51,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 557 transitions. [2021-03-25 04:37:51,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 557 transitions. [2021-03-25 04:37:51,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:51,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 557 transitions. [2021-03-25 04:37:51,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,481 INFO L185 Difference]: Start difference. First operand has 74 places, 80 transitions, 733 flow. Second operand 3 states and 557 transitions. [2021-03-25 04:37:51,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 82 transitions, 795 flow [2021-03-25 04:37:51,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 788 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:37:51,507 INFO L241 Difference]: Finished difference. Result has 75 places, 80 transitions, 758 flow [2021-03-25 04:37:51,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2021-03-25 04:37:51,507 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2021-03-25 04:37:51,508 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:51,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 80 transitions, 758 flow [2021-03-25 04:37:51,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 80 transitions, 758 flow [2021-03-25 04:37:51,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 758 flow [2021-03-25 04:37:51,650 INFO L129 PetriNetUnfolder]: 943/2273 cut-off events. [2021-03-25 04:37:51,650 INFO L130 PetriNetUnfolder]: For 5578/5787 co-relation queries the response was YES. [2021-03-25 04:37:51,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 2273 events. 943/2273 cut-off events. For 5578/5787 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18842 event pairs, 87 based on Foata normal form. 33/2131 useless extension candidates. Maximal degree in co-relation 8382. Up to 808 conditions per place. [2021-03-25 04:37:51,673 INFO L142 LiptonReduction]: Number of co-enabled transitions 1288 [2021-03-25 04:37:51,919 INFO L154 LiptonReduction]: Checked pairs total: 340 [2021-03-25 04:37:51,919 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:37:51,919 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 411 [2021-03-25 04:37:51,919 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 758 flow [2021-03-25 04:37:51,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:51,920 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:51,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:37:51,920 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 831090205, now seen corresponding path program 2 times [2021-03-25 04:37:51,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:51,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038537099] [2021-03-25 04:37:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:51,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:51,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:51,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:51,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:51,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:37:51,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:51,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:51,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038537099] [2021-03-25 04:37:51,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:51,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:37:51,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785238440] [2021-03-25 04:37:51,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:37:51,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:37:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:37:51,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 210 [2021-03-25 04:37:51,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 758 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:51,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:51,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 210 [2021-03-25 04:37:51,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:52,231 INFO L129 PetriNetUnfolder]: 901/2110 cut-off events. [2021-03-25 04:37:52,231 INFO L130 PetriNetUnfolder]: For 6112/7367 co-relation queries the response was YES. [2021-03-25 04:37:52,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9100 conditions, 2110 events. 901/2110 cut-off events. For 6112/7367 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 17218 event pairs, 72 based on Foata normal form. 625/2575 useless extension candidates. Maximal degree in co-relation 9065. Up to 775 conditions per place. [2021-03-25 04:37:52,241 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 2 selfloop transitions, 18 changer transitions 13/84 dead transitions. [2021-03-25 04:37:52,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 844 flow [2021-03-25 04:37:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:37:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:37:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1443 transitions. [2021-03-25 04:37:52,243 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2021-03-25 04:37:52,243 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1443 transitions. [2021-03-25 04:37:52,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1443 transitions. [2021-03-25 04:37:52,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:52,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1443 transitions. [2021-03-25 04:37:52,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 180.375) internal successors, (1443), 8 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:52,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:52,248 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:52,248 INFO L185 Difference]: Start difference. First operand has 75 places, 80 transitions, 758 flow. Second operand 8 states and 1443 transitions. [2021-03-25 04:37:52,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 844 flow [2021-03-25 04:37:52,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 799 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-25 04:37:52,275 INFO L241 Difference]: Finished difference. Result has 82 places, 71 transitions, 647 flow [2021-03-25 04:37:52,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2021-03-25 04:37:52,275 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2021-03-25 04:37:52,275 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:52,275 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 71 transitions, 647 flow [2021-03-25 04:37:52,275 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 71 transitions, 647 flow [2021-03-25 04:37:52,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 71 transitions, 647 flow [2021-03-25 04:37:52,341 INFO L129 PetriNetUnfolder]: 429/1087 cut-off events. [2021-03-25 04:37:52,341 INFO L130 PetriNetUnfolder]: For 3011/3253 co-relation queries the response was YES. [2021-03-25 04:37:52,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 1087 events. 429/1087 cut-off events. For 3011/3253 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8101 event pairs, 38 based on Foata normal form. 6/999 useless extension candidates. Maximal degree in co-relation 4515. Up to 372 conditions per place. [2021-03-25 04:37:52,350 INFO L142 LiptonReduction]: Number of co-enabled transitions 1068 [2021-03-25 04:37:52,649 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 04:37:52,793 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 04:37:53,188 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:37:53,349 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:37:53,386 INFO L154 LiptonReduction]: Checked pairs total: 794 [2021-03-25 04:37:53,387 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:37:53,387 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1112 [2021-03-25 04:37:53,387 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 631 flow [2021-03-25 04:37:53,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:53,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:53,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:53,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:37:53,388 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2029271840, now seen corresponding path program 1 times [2021-03-25 04:37:53,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:53,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343118878] [2021-03-25 04:37:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:37:53,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:53,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:37:53,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:53,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:53,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:37:53,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:37:53,436 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:37:53,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:37:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:37:53,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343118878] [2021-03-25 04:37:53,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:37:53,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:37:53,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437010555] [2021-03-25 04:37:53,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:37:53,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:37:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:37:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:37:53,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 212 [2021-03-25 04:37:53,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 163.2) internal successors, (816), 5 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:53,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:37:53,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 212 [2021-03-25 04:37:53,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:37:53,631 INFO L129 PetriNetUnfolder]: 680/1540 cut-off events. [2021-03-25 04:37:53,631 INFO L130 PetriNetUnfolder]: For 6672/7694 co-relation queries the response was YES. [2021-03-25 04:37:53,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6672 conditions, 1540 events. 680/1540 cut-off events. For 6672/7694 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 12007 event pairs, 29 based on Foata normal form. 103/1507 useless extension candidates. Maximal degree in co-relation 6635. Up to 476 conditions per place. [2021-03-25 04:37:53,639 INFO L132 encePairwiseOnDemand]: 201/212 looper letters, 8 selfloop transitions, 18 changer transitions 52/108 dead transitions. [2021-03-25 04:37:53,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 108 transitions, 1225 flow [2021-03-25 04:37:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:37:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:37:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1006 transitions. [2021-03-25 04:37:53,641 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7908805031446541 [2021-03-25 04:37:53,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1006 transitions. [2021-03-25 04:37:53,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1006 transitions. [2021-03-25 04:37:53,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:37:53,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1006 transitions. [2021-03-25 04:37:53,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:53,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:53,646 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:53,646 INFO L185 Difference]: Start difference. First operand has 78 places, 68 transitions, 631 flow. Second operand 6 states and 1006 transitions. [2021-03-25 04:37:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 108 transitions, 1225 flow [2021-03-25 04:37:53,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 1105 flow, removed 16 selfloop flow, removed 10 redundant places. [2021-03-25 04:37:53,675 INFO L241 Difference]: Finished difference. Result has 75 places, 56 transitions, 441 flow [2021-03-25 04:37:53,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2021-03-25 04:37:53,675 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2021-03-25 04:37:53,675 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:37:53,675 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 56 transitions, 441 flow [2021-03-25 04:37:53,675 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 56 transitions, 441 flow [2021-03-25 04:37:53,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 56 transitions, 441 flow [2021-03-25 04:37:53,728 INFO L129 PetriNetUnfolder]: 266/728 cut-off events. [2021-03-25 04:37:53,728 INFO L130 PetriNetUnfolder]: For 3222/3650 co-relation queries the response was YES. [2021-03-25 04:37:53,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 728 events. 266/728 cut-off events. For 3222/3650 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5181 event pairs, 32 based on Foata normal form. 48/715 useless extension candidates. Maximal degree in co-relation 2400. Up to 215 conditions per place. [2021-03-25 04:37:53,734 INFO L142 LiptonReduction]: Number of co-enabled transitions 710 [2021-03-25 04:37:53,745 INFO L154 LiptonReduction]: Checked pairs total: 192 [2021-03-25 04:37:53,745 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:37:53,746 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-25 04:37:53,746 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 441 flow [2021-03-25 04:37:53,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.2) internal successors, (816), 5 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:37:53,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:37:53,746 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:37:53,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:37:53,746 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:37:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:37:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash -879136586, now seen corresponding path program 1 times [2021-03-25 04:37:53,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:37:53,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612303393] [2021-03-25 04:37:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:37:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:37:53,783 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:37:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:37:53,816 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:37:53,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:37:53,836 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:37:53,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:37:53,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:37:53 BasicIcfg [2021-03-25 04:37:53,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:37:53,915 INFO L168 Benchmark]: Toolchain (without parser) took 15646.97 ms. Allocated memory was 356.5 MB in the beginning and 744.5 MB in the end (delta: 388.0 MB). Free memory was 319.9 MB in the beginning and 524.0 MB in the end (delta: -204.2 MB). Peak memory consumption was 185.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:37:53,915 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 356.5 MB. Free memory was 338.0 MB in the beginning and 337.9 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:37:53,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.51 ms. Allocated memory is still 356.5 MB. Free memory was 319.6 MB in the beginning and 315.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:37:53,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.54 ms. Allocated memory is still 356.5 MB. Free memory was 315.2 MB in the beginning and 312.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:37:53,916 INFO L168 Benchmark]: Boogie Preprocessor took 21.04 ms. Allocated memory is still 356.5 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:37:53,916 INFO L168 Benchmark]: RCFGBuilder took 1530.15 ms. Allocated memory is still 356.5 MB. Free memory was 309.9 MB in the beginning and 244.3 MB in the end (delta: 65.6 MB). Peak memory consumption was 165.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:37:53,916 INFO L168 Benchmark]: TraceAbstraction took 13673.37 ms. Allocated memory was 356.5 MB in the beginning and 744.5 MB in the end (delta: 388.0 MB). Free memory was 244.3 MB in the beginning and 524.0 MB in the end (delta: -279.7 MB). Peak memory consumption was 107.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:37:53,917 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.12 ms. Allocated memory is still 356.5 MB. Free memory was 338.0 MB in the beginning and 337.9 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 387.51 ms. Allocated memory is still 356.5 MB. Free memory was 319.6 MB in the beginning and 315.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 29.54 ms. Allocated memory is still 356.5 MB. Free memory was 315.2 MB in the beginning and 312.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.04 ms. Allocated memory is still 356.5 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1530.15 ms. Allocated memory is still 356.5 MB. Free memory was 309.9 MB in the beginning and 244.3 MB in the end (delta: 65.6 MB). Peak memory consumption was 165.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13673.37 ms. Allocated memory was 356.5 MB in the beginning and 744.5 MB in the end (delta: 388.0 MB). Free memory was 244.3 MB in the beginning and 524.0 MB in the end (delta: -279.7 MB). Peak memory consumption was 107.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2178.5ms, 126 PlacesBefore, 61 PlacesAfterwards, 115 TransitionsBefore, 49 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 5866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2623, positive: 2495, positive conditional: 0, positive unconditional: 2495, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1411, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1411, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2623, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 1411, unknown conditional: 0, unknown unconditional: 1411] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1149.1ms, 57 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 32 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2944 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 609, positive: 474, positive conditional: 0, positive unconditional: 474, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 89, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 609, positive: 413, positive conditional: 0, positive unconditional: 413, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 89, unknown conditional: 0, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1652.2ms, 49 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1002 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 130, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.0ms, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 63, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 118, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.6ms, 58 PlacesBefore, 58 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1019 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 149, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.2ms, 60 PlacesBefore, 60 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 863 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 23, negative conditional: 0, negative unconditional: 23, 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: 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] , Cache Queries: [ total: 117, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1013.7ms, 65 PlacesBefore, 65 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 1374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2217 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 244, positive: 194, positive conditional: 0, positive unconditional: 194, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 244, positive: 191, positive conditional: 0, positive unconditional: 191, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 709.5ms, 69 PlacesBefore, 69 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 1452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 269, positive conditional: 0, positive unconditional: 269, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 315, positive: 252, positive conditional: 0, positive unconditional: 252, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 253.1ms, 72 PlacesBefore, 72 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 1328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2667 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 257, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 257, positive: 186, positive conditional: 0, positive unconditional: 186, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 676.3ms, 74 PlacesBefore, 74 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 137, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 411.4ms, 75 PlacesBefore, 75 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, 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: 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] , Cache Queries: [ total: 31, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1111.1ms, 82 PlacesBefore, 78 PlacesAfterwards, 71 TransitionsBefore, 68 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 794 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 24, negative conditional: 0, negative unconditional: 24, 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: 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] , Cache Queries: [ total: 76, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.1ms, 75 PlacesBefore, 74 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13493.5ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2451.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2258.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 113 SDtfs, 61 SDslu, 82 SDs, 0 SdLazy, 370 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 310.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 267.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.5ms SsaConstructionTime, 289.1ms SatisfiabilityAnalysisTime, 660.0ms InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...