/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:07:30,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:07:30,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:07:30,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:07:30,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:07:30,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:07:30,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:07:30,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:07:30,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:07:30,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:07:30,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:07:30,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:07:30,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:07:30,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:07:30,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:07:30,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:07:30,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:07:30,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:07:30,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:07:30,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:07:30,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:07:30,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:07:30,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:07:30,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:07:30,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:07:30,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:07:30,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:07:30,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:07:30,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:07:30,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:07:30,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:07:30,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:07:30,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:07:30,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:07:30,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:07:30,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:07:30,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:07:30,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:07:30,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:07:30,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:07:30,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:07:30,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:07:30,249 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:07:30,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:07:30,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:07:30,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:07:30,253 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:07:30,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:07:30,253 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:07:30,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:07:30,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:07:30,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:07:30,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:07:30,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:07:30,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:07:30,255 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:07:30,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:07:30,255 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:07:30,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:07:30,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:07:30,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:07:30,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:07:30,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:07:30,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:07:30,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:07:30,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:07:30,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:07:30,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:07:30,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:07:30,257 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:07:30,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:07:30,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:07:30,257 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:07:30,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:07:30,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:07:30,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:07:30,569 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:07:30,570 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:07:30,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_rmo.opt.i [2021-03-26 00:07:30,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7475a808/161204009a2240828cba7d6dec169fbb/FLAGc21854c2b [2021-03-26 00:07:31,142 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:07:31,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_rmo.opt.i [2021-03-26 00:07:31,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7475a808/161204009a2240828cba7d6dec169fbb/FLAGc21854c2b [2021-03-26 00:07:31,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7475a808/161204009a2240828cba7d6dec169fbb [2021-03-26 00:07:31,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:07:31,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:07:31,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:07:31,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:07:31,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:07:31,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:07:31" (1/1) ... [2021-03-26 00:07:31,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ab5f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:31, skipping insertion in model container [2021-03-26 00:07:31,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:07:31" (1/1) ... [2021-03-26 00:07:31,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:07:31,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:07:31,644 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/mix018_rmo.opt.i[948,961] [2021-03-26 00:07:31,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:07:31,889 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:07:31,901 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/mix018_rmo.opt.i[948,961] [2021-03-26 00:07:31,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:07:32,039 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:07:32,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32 WrapperNode [2021-03-26 00:07:32,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:07:32,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:07:32,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:07:32,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:07:32,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:07:32,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:07:32,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:07:32,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:07:32,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... [2021-03-26 00:07:32,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:07:32,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:07:32,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:07:32,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:07:32,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:07:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:07:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:07:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:07:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:07:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:07:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:07:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:07:32,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:07:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:07:32,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:07:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:07:32,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:07:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:07:32,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:07:32,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:07:32,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:07:32,257 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:07:34,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:07:34,319 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:07:34,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:07:34 BoogieIcfgContainer [2021-03-26 00:07:34,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:07:34,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:07:34,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:07:34,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:07:34,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:07:31" (1/3) ... [2021-03-26 00:07:34,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9359b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:07:34, skipping insertion in model container [2021-03-26 00:07:34,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:07:32" (2/3) ... [2021-03-26 00:07:34,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9359b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:07:34, skipping insertion in model container [2021-03-26 00:07:34,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:07:34" (3/3) ... [2021-03-26 00:07:34,327 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_rmo.opt.i [2021-03-26 00:07:34,332 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:07:34,336 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:07:34,337 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:07:34,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,404 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,404 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,404 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,404 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,404 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,406 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,406 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,429 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:07:34,430 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:07:34,445 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:07:34,475 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:07:34,475 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:07:34,475 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:07:34,475 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:07:34,475 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:07:34,475 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:07:34,476 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:07:34,476 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:07:34,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-26 00:07:34,536 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 00:07:34,536 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:34,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:07:34,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-26 00:07:34,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-26 00:07:34,559 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:34,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-26 00:07:34,575 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-26 00:07:34,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-26 00:07:34,610 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 00:07:34,611 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:34,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:07:34,615 INFO L142 LiptonReduction]: Number of co-enabled transitions 2394 [2021-03-26 00:07:36,029 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:07:36,464 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 00:07:36,612 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:07:38,032 INFO L154 LiptonReduction]: Checked pairs total: 3759 [2021-03-26 00:07:38,032 INFO L156 LiptonReduction]: Total number of compositions: 73 [2021-03-26 00:07:38,034 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3476 [2021-03-26 00:07:38,045 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 00:07:38,045 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:38,045 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:38,046 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] [2021-03-26 00:07:38,046 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:38,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1799313530, now seen corresponding path program 1 times [2021-03-26 00:07:38,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:38,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677119702] [2021-03-26 00:07:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:38,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:38,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:38,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:38,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:38,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677119702] [2021-03-26 00:07:38,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:38,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:07:38,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412120751] [2021-03-26 00:07:38,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:07:38,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:07:38,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:07:38,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2021-03-26 00:07:38,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:38,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:38,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2021-03-26 00:07:38,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:38,468 INFO L129 PetriNetUnfolder]: 13/83 cut-off events. [2021-03-26 00:07:38,468 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:38,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 83 events. 13/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 233 event pairs, 5 based on Foata normal form. 7/85 useless extension candidates. Maximal degree in co-relation 102. Up to 25 conditions per place. [2021-03-26 00:07:38,473 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 6 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-26 00:07:38,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 118 flow [2021-03-26 00:07:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:07:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:07:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2021-03-26 00:07:38,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184397163120568 [2021-03-26 00:07:38,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2021-03-26 00:07:38,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2021-03-26 00:07:38,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:38,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2021-03-26 00:07:38,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:38,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:38,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:38,523 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 518 transitions. [2021-03-26 00:07:38,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 118 flow [2021-03-26 00:07:38,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:07:38,528 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-26 00:07:38,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 00:07:38,530 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-26 00:07:38,530 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:38,530 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 00:07:38,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 00:07:38,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-26 00:07:38,538 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 00:07:38,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:38,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:07:38,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 440 [2021-03-26 00:07:39,047 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:07:39,176 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:07:40,567 INFO L154 LiptonReduction]: Checked pairs total: 1334 [2021-03-26 00:07:40,568 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 00:07:40,568 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2038 [2021-03-26 00:07:40,569 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 00:07:40,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:40,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:40,570 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] [2021-03-26 00:07:40,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:07:40,570 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1766782407, now seen corresponding path program 1 times [2021-03-26 00:07:40,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:40,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222367146] [2021-03-26 00:07:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:40,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:40,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:40,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:40,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:40,665 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:07:40,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:07:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:40,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222367146] [2021-03-26 00:07:40,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:40,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:07:40,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809673552] [2021-03-26 00:07:40,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:07:40,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:07:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:07:40,674 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 202 [2021-03-26 00:07:40,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:40,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:40,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 202 [2021-03-26 00:07:40,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:40,711 INFO L129 PetriNetUnfolder]: 1/31 cut-off events. [2021-03-26 00:07:40,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:40,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2021-03-26 00:07:40,712 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 1 selfloop transitions, 2 changer transitions 3/31 dead transitions. [2021-03-26 00:07:40,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 86 flow [2021-03-26 00:07:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:07:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:07:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2021-03-26 00:07:40,715 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8930693069306931 [2021-03-26 00:07:40,715 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2021-03-26 00:07:40,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2021-03-26 00:07:40,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:40,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2021-03-26 00:07:40,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:40,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:40,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:40,721 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 902 transitions. [2021-03-26 00:07:40,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 86 flow [2021-03-26 00:07:40,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:07:40,722 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 72 flow [2021-03-26 00:07:40,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-03-26 00:07:40,723 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2021-03-26 00:07:40,723 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:40,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 72 flow [2021-03-26 00:07:40,723 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 72 flow [2021-03-26 00:07:40,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-26 00:07:40,727 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:07:40,728 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:07:40,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:07:40,728 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-26 00:07:41,241 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-03-26 00:07:41,857 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:07:42,008 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:07:42,318 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:07:42,477 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:07:42,481 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 00:07:42,481 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:07:42,481 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1758 [2021-03-26 00:07:42,482 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-26 00:07:42,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:42,483 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:07:42,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:07:42,483 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash 400746835, now seen corresponding path program 1 times [2021-03-26 00:07:42,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:42,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569157609] [2021-03-26 00:07:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:42,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:42,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:42,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569157609] [2021-03-26 00:07:42,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:42,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:07:42,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14306050] [2021-03-26 00:07:42,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:07:42,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:42,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:07:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:07:42,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 205 [2021-03-26 00:07:42,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:42,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 205 [2021-03-26 00:07:42,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:42,587 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 00:07:42,587 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:07:42,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-26 00:07:42,588 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-26 00:07:42,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 82 flow [2021-03-26 00:07:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:07:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:07:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2021-03-26 00:07:42,590 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8991869918699187 [2021-03-26 00:07:42,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2021-03-26 00:07:42,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2021-03-26 00:07:42,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:42,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2021-03-26 00:07:42,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,594 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 553 transitions. [2021-03-26 00:07:42,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 82 flow [2021-03-26 00:07:42,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:07:42,595 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2021-03-26 00:07:42,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-26 00:07:42,595 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -20 predicate places. [2021-03-26 00:07:42,595 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:42,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 81 flow [2021-03-26 00:07:42,596 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 81 flow [2021-03-26 00:07:42,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 81 flow [2021-03-26 00:07:42,600 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:07:42,601 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:07:42,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 00:07:42,601 INFO L142 LiptonReduction]: Number of co-enabled transitions 346 [2021-03-26 00:07:42,605 INFO L154 LiptonReduction]: Checked pairs total: 308 [2021-03-26 00:07:42,605 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:07:42,606 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 00:07:42,607 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2021-03-26 00:07:42,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:42,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:07:42,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:07:42,607 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash -683642900, now seen corresponding path program 1 times [2021-03-26 00:07:42,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:42,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686655419] [2021-03-26 00:07:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:42,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:42,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:42,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:42,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:07:42,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:42,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:42,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686655419] [2021-03-26 00:07:42,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:42,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:07:42,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115556263] [2021-03-26 00:07:42,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:07:42,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:42,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:07:42,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:07:42,722 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-26 00:07:42,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:42,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-26 00:07:42,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:42,784 INFO L129 PetriNetUnfolder]: 138/271 cut-off events. [2021-03-26 00:07:42,784 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-03-26 00:07:42,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 271 events. 138/271 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1328 event pairs, 71 based on Foata normal form. 20/255 useless extension candidates. Maximal degree in co-relation 554. Up to 160 conditions per place. [2021-03-26 00:07:42,787 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 9 selfloop transitions, 9 changer transitions 2/40 dead transitions. [2021-03-26 00:07:42,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 147 flow [2021-03-26 00:07:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:07:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:07:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 887 transitions. [2021-03-26 00:07:42,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8653658536585366 [2021-03-26 00:07:42,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 887 transitions. [2021-03-26 00:07:42,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 887 transitions. [2021-03-26 00:07:42,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:42,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 887 transitions. [2021-03-26 00:07:42,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,795 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,795 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 5 states and 887 transitions. [2021-03-26 00:07:42,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 147 flow [2021-03-26 00:07:42,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:07:42,797 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 147 flow [2021-03-26 00:07:42,797 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 00:07:42,797 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2021-03-26 00:07:42,797 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:42,798 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 147 flow [2021-03-26 00:07:42,798 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 147 flow [2021-03-26 00:07:42,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 147 flow [2021-03-26 00:07:42,851 INFO L129 PetriNetUnfolder]: 130/245 cut-off events. [2021-03-26 00:07:42,851 INFO L130 PetriNetUnfolder]: For 128/171 co-relation queries the response was YES. [2021-03-26 00:07:42,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 245 events. 130/245 cut-off events. For 128/171 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1172 event pairs, 69 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 676. Up to 177 conditions per place. [2021-03-26 00:07:42,855 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 00:07:42,948 INFO L154 LiptonReduction]: Checked pairs total: 757 [2021-03-26 00:07:42,948 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:07:42,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 151 [2021-03-26 00:07:42,949 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 141 flow [2021-03-26 00:07:42,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:42,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:42,950 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:07:42,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:07:42,950 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1312666967, now seen corresponding path program 1 times [2021-03-26 00:07:42,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:42,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141473108] [2021-03-26 00:07:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:42,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:43,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:43,003 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:07:43,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:07:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:43,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141473108] [2021-03-26 00:07:43,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:43,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:07:43,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811339054] [2021-03-26 00:07:43,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:07:43,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:07:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:07:43,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-26 00:07:43,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:43,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-26 00:07:43,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:43,156 INFO L129 PetriNetUnfolder]: 594/1137 cut-off events. [2021-03-26 00:07:43,156 INFO L130 PetriNetUnfolder]: For 954/1154 co-relation queries the response was YES. [2021-03-26 00:07:43,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3188 conditions, 1137 events. 594/1137 cut-off events. For 954/1154 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7483 event pairs, 308 based on Foata normal form. 48/1073 useless extension candidates. Maximal degree in co-relation 3173. Up to 699 conditions per place. [2021-03-26 00:07:43,168 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 8 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2021-03-26 00:07:43,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 178 flow [2021-03-26 00:07:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:07:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:07:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-26 00:07:43,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8536585365853658 [2021-03-26 00:07:43,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-26 00:07:43,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-26 00:07:43,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:43,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-26 00:07:43,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,175 INFO L185 Difference]: Start difference. First operand has 44 places, 34 transitions, 141 flow. Second operand 3 states and 525 transitions. [2021-03-26 00:07:43,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 178 flow [2021-03-26 00:07:43,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:07:43,182 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 189 flow [2021-03-26 00:07:43,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-03-26 00:07:43,182 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2021-03-26 00:07:43,183 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:43,183 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 189 flow [2021-03-26 00:07:43,183 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 189 flow [2021-03-26 00:07:43,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 189 flow [2021-03-26 00:07:43,281 INFO L129 PetriNetUnfolder]: 577/1087 cut-off events. [2021-03-26 00:07:43,282 INFO L130 PetriNetUnfolder]: For 757/964 co-relation queries the response was YES. [2021-03-26 00:07:43,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 1087 events. 577/1087 cut-off events. For 757/964 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 7107 event pairs, 262 based on Foata normal form. 1/969 useless extension candidates. Maximal degree in co-relation 2979. Up to 651 conditions per place. [2021-03-26 00:07:43,296 INFO L142 LiptonReduction]: Number of co-enabled transitions 502 [2021-03-26 00:07:43,483 INFO L154 LiptonReduction]: Checked pairs total: 125 [2021-03-26 00:07:43,483 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:07:43,483 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 300 [2021-03-26 00:07:43,485 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 189 flow [2021-03-26 00:07:43,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:43,486 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:07:43,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:07:43,486 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1182517867, now seen corresponding path program 2 times [2021-03-26 00:07:43,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:43,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316488974] [2021-03-26 00:07:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:43,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:43,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:43,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:43,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:43,560 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:07:43,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:07:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:43,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316488974] [2021-03-26 00:07:43,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:43,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:07:43,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726606795] [2021-03-26 00:07:43,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:07:43,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:07:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:07:43,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-26 00:07:43,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:43,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-26 00:07:43,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:43,740 INFO L129 PetriNetUnfolder]: 706/1345 cut-off events. [2021-03-26 00:07:43,740 INFO L130 PetriNetUnfolder]: For 1383/2188 co-relation queries the response was YES. [2021-03-26 00:07:43,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 1345 events. 706/1345 cut-off events. For 1383/2188 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 9247 event pairs, 365 based on Foata normal form. 74/1263 useless extension candidates. Maximal degree in co-relation 3899. Up to 888 conditions per place. [2021-03-26 00:07:43,753 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 14 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2021-03-26 00:07:43,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 265 flow [2021-03-26 00:07:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:07:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:07:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-03-26 00:07:43,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8512195121951219 [2021-03-26 00:07:43,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-03-26 00:07:43,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-03-26 00:07:43,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:43,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-03-26 00:07:43,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,759 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:43,759 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 189 flow. Second operand 4 states and 698 transitions. [2021-03-26 00:07:43,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 265 flow [2021-03-26 00:07:43,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:07:43,763 INFO L241 Difference]: Finished difference. Result has 47 places, 40 transitions, 214 flow [2021-03-26 00:07:43,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2021-03-26 00:07:43,763 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2021-03-26 00:07:43,763 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:43,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 214 flow [2021-03-26 00:07:43,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 214 flow [2021-03-26 00:07:43,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 214 flow [2021-03-26 00:07:43,929 INFO L129 PetriNetUnfolder]: 726/1367 cut-off events. [2021-03-26 00:07:43,929 INFO L130 PetriNetUnfolder]: For 1188/1484 co-relation queries the response was YES. [2021-03-26 00:07:43,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 1367 events. 726/1367 cut-off events. For 1188/1484 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9430 event pairs, 363 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 3768. Up to 907 conditions per place. [2021-03-26 00:07:43,945 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 00:07:44,118 INFO L154 LiptonReduction]: Checked pairs total: 170 [2021-03-26 00:07:44,119 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:07:44,119 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 356 [2021-03-26 00:07:44,123 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 214 flow [2021-03-26 00:07:44,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:44,124 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:07:44,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:07:44,124 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1283126035, now seen corresponding path program 1 times [2021-03-26 00:07:44,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:44,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730620226] [2021-03-26 00:07:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:44,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:44,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:44,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:07:44,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:44,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730620226] [2021-03-26 00:07:44,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:44,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:07:44,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718174187] [2021-03-26 00:07:44,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:07:44,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:44,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:07:44,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:07:44,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-26 00:07:44,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:44,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-26 00:07:44,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:44,394 INFO L129 PetriNetUnfolder]: 499/1101 cut-off events. [2021-03-26 00:07:44,395 INFO L130 PetriNetUnfolder]: For 1177/2633 co-relation queries the response was YES. [2021-03-26 00:07:44,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 1101 events. 499/1101 cut-off events. For 1177/2633 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7960 event pairs, 122 based on Foata normal form. 259/1283 useless extension candidates. Maximal degree in co-relation 3873. Up to 790 conditions per place. [2021-03-26 00:07:44,406 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2021-03-26 00:07:44,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 338 flow [2021-03-26 00:07:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:07:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:07:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2021-03-26 00:07:44,409 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.865040650406504 [2021-03-26 00:07:44,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2021-03-26 00:07:44,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2021-03-26 00:07:44,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:44,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2021-03-26 00:07:44,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,414 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,414 INFO L185 Difference]: Start difference. First operand has 47 places, 40 transitions, 214 flow. Second operand 6 states and 1064 transitions. [2021-03-26 00:07:44,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 338 flow [2021-03-26 00:07:44,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 332 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 00:07:44,419 INFO L241 Difference]: Finished difference. Result has 55 places, 49 transitions, 328 flow [2021-03-26 00:07:44,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2021-03-26 00:07:44,420 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-26 00:07:44,420 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:44,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 49 transitions, 328 flow [2021-03-26 00:07:44,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 49 transitions, 328 flow [2021-03-26 00:07:44,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 328 flow [2021-03-26 00:07:44,531 INFO L129 PetriNetUnfolder]: 496/1073 cut-off events. [2021-03-26 00:07:44,532 INFO L130 PetriNetUnfolder]: For 2859/3433 co-relation queries the response was YES. [2021-03-26 00:07:44,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 1073 events. 496/1073 cut-off events. For 2859/3433 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7791 event pairs, 103 based on Foata normal form. 31/1043 useless extension candidates. Maximal degree in co-relation 4523. Up to 775 conditions per place. [2021-03-26 00:07:44,549 INFO L142 LiptonReduction]: Number of co-enabled transitions 744 [2021-03-26 00:07:44,810 INFO L154 LiptonReduction]: Checked pairs total: 391 [2021-03-26 00:07:44,810 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:07:44,811 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 391 [2021-03-26 00:07:44,812 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 320 flow [2021-03-26 00:07:44,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:44,813 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:07:44,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:07:44,813 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273275, now seen corresponding path program 1 times [2021-03-26 00:07:44,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:44,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962393448] [2021-03-26 00:07:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:44,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:44,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:44,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:44,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:07:44,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:44,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:44,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962393448] [2021-03-26 00:07:44,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:44,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:07:44,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557427757] [2021-03-26 00:07:44,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:07:44,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:07:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:07:44,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-26 00:07:44,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:44,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:44,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-26 00:07:44,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:45,042 INFO L129 PetriNetUnfolder]: 267/648 cut-off events. [2021-03-26 00:07:45,042 INFO L130 PetriNetUnfolder]: For 2308/3849 co-relation queries the response was YES. [2021-03-26 00:07:45,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3028 conditions, 648 events. 267/648 cut-off events. For 2308/3849 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4141 event pairs, 39 based on Foata normal form. 275/888 useless extension candidates. Maximal degree in co-relation 3004. Up to 451 conditions per place. [2021-03-26 00:07:45,050 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 18 changer transitions 4/57 dead transitions. [2021-03-26 00:07:45,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 462 flow [2021-03-26 00:07:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:07:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:07:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1241 transitions. [2021-03-26 00:07:45,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.864808362369338 [2021-03-26 00:07:45,053 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1241 transitions. [2021-03-26 00:07:45,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1241 transitions. [2021-03-26 00:07:45,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:45,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1241 transitions. [2021-03-26 00:07:45,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.28571428571428) internal successors, (1241), 7 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,061 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,061 INFO L185 Difference]: Start difference. First operand has 55 places, 48 transitions, 320 flow. Second operand 7 states and 1241 transitions. [2021-03-26 00:07:45,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 462 flow [2021-03-26 00:07:45,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 400 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:07:45,070 INFO L241 Difference]: Finished difference. Result has 58 places, 53 transitions, 380 flow [2021-03-26 00:07:45,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2021-03-26 00:07:45,071 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2021-03-26 00:07:45,071 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:45,071 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 380 flow [2021-03-26 00:07:45,071 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 380 flow [2021-03-26 00:07:45,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 380 flow [2021-03-26 00:07:45,184 INFO L129 PetriNetUnfolder]: 256/618 cut-off events. [2021-03-26 00:07:45,185 INFO L130 PetriNetUnfolder]: For 1415/1516 co-relation queries the response was YES. [2021-03-26 00:07:45,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 618 events. 256/618 cut-off events. For 1415/1516 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4021 event pairs, 30 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 2524. Up to 383 conditions per place. [2021-03-26 00:07:45,193 INFO L142 LiptonReduction]: Number of co-enabled transitions 728 [2021-03-26 00:07:45,236 INFO L154 LiptonReduction]: Checked pairs total: 391 [2021-03-26 00:07:45,236 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:07:45,237 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 165 [2021-03-26 00:07:45,239 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 370 flow [2021-03-26 00:07:45,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:45,240 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] [2021-03-26 00:07:45,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:07:45,240 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash 373365034, now seen corresponding path program 1 times [2021-03-26 00:07:45,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:45,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15358999] [2021-03-26 00:07:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:45,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:45,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:45,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:45,319 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:07:45,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:07:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:45,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15358999] [2021-03-26 00:07:45,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:45,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:07:45,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755595431] [2021-03-26 00:07:45,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:07:45,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:07:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:07:45,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 205 [2021-03-26 00:07:45,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 370 flow. Second operand has 5 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-26 00:07:45,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:45,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 205 [2021-03-26 00:07:45,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:45,474 INFO L129 PetriNetUnfolder]: 378/852 cut-off events. [2021-03-26 00:07:45,474 INFO L130 PetriNetUnfolder]: For 2014/2424 co-relation queries the response was YES. [2021-03-26 00:07:45,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3416 conditions, 852 events. 378/852 cut-off events. For 2014/2424 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5574 event pairs, 19 based on Foata normal form. 17/832 useless extension candidates. Maximal degree in co-relation 3391. Up to 448 conditions per place. [2021-03-26 00:07:45,482 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 17 selfloop transitions, 19 changer transitions 7/71 dead transitions. [2021-03-26 00:07:45,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 550 flow [2021-03-26 00:07:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:07:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:07:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2021-03-26 00:07:45,484 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8308943089430895 [2021-03-26 00:07:45,484 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1022 transitions. [2021-03-26 00:07:45,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1022 transitions. [2021-03-26 00:07:45,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:45,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1022 transitions. [2021-03-26 00:07:45,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,490 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,490 INFO L185 Difference]: Start difference. First operand has 58 places, 52 transitions, 370 flow. Second operand 6 states and 1022 transitions. [2021-03-26 00:07:45,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 550 flow [2021-03-26 00:07:45,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 509 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:07:45,503 INFO L241 Difference]: Finished difference. Result has 59 places, 55 transitions, 380 flow [2021-03-26 00:07:45,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2021-03-26 00:07:45,504 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-26 00:07:45,504 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:45,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 55 transitions, 380 flow [2021-03-26 00:07:45,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 380 flow [2021-03-26 00:07:45,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 380 flow [2021-03-26 00:07:45,572 INFO L129 PetriNetUnfolder]: 323/762 cut-off events. [2021-03-26 00:07:45,572 INFO L130 PetriNetUnfolder]: For 1135/1196 co-relation queries the response was YES. [2021-03-26 00:07:45,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 762 events. 323/762 cut-off events. For 1135/1196 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5047 event pairs, 34 based on Foata normal form. 1/722 useless extension candidates. Maximal degree in co-relation 2471. Up to 297 conditions per place. [2021-03-26 00:07:45,582 INFO L142 LiptonReduction]: Number of co-enabled transitions 656 [2021-03-26 00:07:45,697 INFO L154 LiptonReduction]: Checked pairs total: 288 [2021-03-26 00:07:45,697 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:07:45,697 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 193 [2021-03-26 00:07:45,698 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 380 flow [2021-03-26 00:07:45,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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-26 00:07:45,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:45,699 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] [2021-03-26 00:07:45,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:07:45,699 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:45,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1747633098, now seen corresponding path program 2 times [2021-03-26 00:07:45,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:45,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34295710] [2021-03-26 00:07:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:45,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:45,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:45,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:45,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:45,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:07:45,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:45,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:45,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34295710] [2021-03-26 00:07:45,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:45,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:07:45,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308995474] [2021-03-26 00:07:45,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:07:45,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:07:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:07:45,819 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-26 00:07:45,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:45,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-26 00:07:45,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:45,965 INFO L129 PetriNetUnfolder]: 301/713 cut-off events. [2021-03-26 00:07:45,965 INFO L130 PetriNetUnfolder]: For 1336/1847 co-relation queries the response was YES. [2021-03-26 00:07:45,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 713 events. 301/713 cut-off events. For 1336/1847 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4564 event pairs, 37 based on Foata normal form. 233/904 useless extension candidates. Maximal degree in co-relation 2734. Up to 272 conditions per place. [2021-03-26 00:07:45,970 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 2 selfloop transitions, 18 changer transitions 14/60 dead transitions. [2021-03-26 00:07:45,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 476 flow [2021-03-26 00:07:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:07:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:07:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1410 transitions. [2021-03-26 00:07:45,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8597560975609756 [2021-03-26 00:07:45,974 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1410 transitions. [2021-03-26 00:07:45,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1410 transitions. [2021-03-26 00:07:45,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:45,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1410 transitions. [2021-03-26 00:07:45,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 176.25) internal successors, (1410), 8 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,982 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:45,982 INFO L185 Difference]: Start difference. First operand has 59 places, 55 transitions, 380 flow. Second operand 8 states and 1410 transitions. [2021-03-26 00:07:45,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 476 flow [2021-03-26 00:07:45,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 434 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-26 00:07:45,990 INFO L241 Difference]: Finished difference. Result has 67 places, 46 transitions, 318 flow [2021-03-26 00:07:45,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2021-03-26 00:07:45,991 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2021-03-26 00:07:45,991 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:45,991 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 46 transitions, 318 flow [2021-03-26 00:07:45,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 46 transitions, 318 flow [2021-03-26 00:07:45,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 46 transitions, 318 flow [2021-03-26 00:07:46,015 INFO L129 PetriNetUnfolder]: 94/248 cut-off events. [2021-03-26 00:07:46,015 INFO L130 PetriNetUnfolder]: For 442/486 co-relation queries the response was YES. [2021-03-26 00:07:46,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 248 events. 94/248 cut-off events. For 442/486 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1295 event pairs, 11 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 907. Up to 93 conditions per place. [2021-03-26 00:07:46,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-26 00:07:46,418 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:07:46,582 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:07:46,728 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:07:47,004 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:07:47,208 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:07:47,215 INFO L154 LiptonReduction]: Checked pairs total: 337 [2021-03-26 00:07:47,215 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:07:47,215 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1224 [2021-03-26 00:07:47,215 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 302 flow [2021-03-26 00:07:47,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:47,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:47,216 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-26 00:07:47,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:07:47,216 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:47,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 375577028, now seen corresponding path program 1 times [2021-03-26 00:07:47,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:47,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176444154] [2021-03-26 00:07:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:47,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:47,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:47,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:47,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:47,271 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:07:47,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:07:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:47,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176444154] [2021-03-26 00:07:47,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:47,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:07:47,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199865921] [2021-03-26 00:07:47,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:07:47,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:07:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:07:47,284 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 207 [2021-03-26 00:07:47,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 302 flow. Second operand has 4 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-26 00:07:47,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:47,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 207 [2021-03-26 00:07:47,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:47,367 INFO L129 PetriNetUnfolder]: 144/337 cut-off events. [2021-03-26 00:07:47,367 INFO L130 PetriNetUnfolder]: For 809/925 co-relation queries the response was YES. [2021-03-26 00:07:47,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 337 events. 144/337 cut-off events. For 809/925 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1762 event pairs, 9 based on Foata normal form. 28/346 useless extension candidates. Maximal degree in co-relation 1292. Up to 118 conditions per place. [2021-03-26 00:07:47,370 INFO L132 encePairwiseOnDemand]: 198/207 looper letters, 10 selfloop transitions, 14 changer transitions 1/52 dead transitions. [2021-03-26 00:07:47,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 405 flow [2021-03-26 00:07:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:07:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:07:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 855 transitions. [2021-03-26 00:07:47,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2021-03-26 00:07:47,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 855 transitions. [2021-03-26 00:07:47,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 855 transitions. [2021-03-26 00:07:47,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:47,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 855 transitions. [2021-03-26 00:07:47,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:47,377 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-26 00:07:47,378 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-26 00:07:47,378 INFO L185 Difference]: Start difference. First operand has 63 places, 43 transitions, 302 flow. Second operand 5 states and 855 transitions. [2021-03-26 00:07:47,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 405 flow [2021-03-26 00:07:47,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 336 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-03-26 00:07:47,383 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 346 flow [2021-03-26 00:07:47,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-03-26 00:07:47,383 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-26 00:07:47,383 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:47,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 346 flow [2021-03-26 00:07:47,383 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 346 flow [2021-03-26 00:07:47,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 346 flow [2021-03-26 00:07:47,412 INFO L129 PetriNetUnfolder]: 136/321 cut-off events. [2021-03-26 00:07:47,412 INFO L130 PetriNetUnfolder]: For 468/514 co-relation queries the response was YES. [2021-03-26 00:07:47,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 321 events. 136/321 cut-off events. For 468/514 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1785 event pairs, 4 based on Foata normal form. 11/306 useless extension candidates. Maximal degree in co-relation 982. Up to 98 conditions per place. [2021-03-26 00:07:47,416 INFO L142 LiptonReduction]: Number of co-enabled transitions 438 [2021-03-26 00:07:47,556 INFO L154 LiptonReduction]: Checked pairs total: 216 [2021-03-26 00:07:47,556 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:07:47,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 173 [2021-03-26 00:07:47,557 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 346 flow [2021-03-26 00:07:47,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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-26 00:07:47,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:47,558 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] [2021-03-26 00:07:47,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:07:47,558 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:47,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash 738142640, now seen corresponding path program 1 times [2021-03-26 00:07:47,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:47,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018601487] [2021-03-26 00:07:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:07:47,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:47,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:07:47,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:47,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:47,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:07:47,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:07:47,640 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:07:47,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:07:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:07:47,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018601487] [2021-03-26 00:07:47,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:07:47,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:07:47,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190073032] [2021-03-26 00:07:47,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:07:47,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:07:47,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:07:47,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:07:47,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 207 [2021-03-26 00:07:47,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:47,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:07:47,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 207 [2021-03-26 00:07:47,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:07:47,734 INFO L129 PetriNetUnfolder]: 182/418 cut-off events. [2021-03-26 00:07:47,734 INFO L130 PetriNetUnfolder]: For 684/770 co-relation queries the response was YES. [2021-03-26 00:07:47,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 418 events. 182/418 cut-off events. For 684/770 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2355 event pairs, 9 based on Foata normal form. 30/421 useless extension candidates. Maximal degree in co-relation 1372. Up to 130 conditions per place. [2021-03-26 00:07:47,738 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 5 selfloop transitions, 6 changer transitions 20/58 dead transitions. [2021-03-26 00:07:47,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 472 flow [2021-03-26 00:07:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:07:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:07:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1024 transitions. [2021-03-26 00:07:47,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8244766505636071 [2021-03-26 00:07:47,741 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1024 transitions. [2021-03-26 00:07:47,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1024 transitions. [2021-03-26 00:07:47,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:07:47,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1024 transitions. [2021-03-26 00:07:47,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.66666666666666) internal successors, (1024), 6 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:47,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:47,746 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:47,746 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 346 flow. Second operand 6 states and 1024 transitions. [2021-03-26 00:07:47,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 472 flow [2021-03-26 00:07:47,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:07:47,755 INFO L241 Difference]: Finished difference. Result has 65 places, 38 transitions, 249 flow [2021-03-26 00:07:47,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2021-03-26 00:07:47,755 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2021-03-26 00:07:47,755 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:07:47,755 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 38 transitions, 249 flow [2021-03-26 00:07:47,755 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 38 transitions, 249 flow [2021-03-26 00:07:47,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 38 transitions, 249 flow [2021-03-26 00:07:47,768 INFO L129 PetriNetUnfolder]: 54/144 cut-off events. [2021-03-26 00:07:47,768 INFO L130 PetriNetUnfolder]: For 285/316 co-relation queries the response was YES. [2021-03-26 00:07:47,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 144 events. 54/144 cut-off events. For 285/316 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 606 event pairs, 3 based on Foata normal form. 9/142 useless extension candidates. Maximal degree in co-relation 445. Up to 44 conditions per place. [2021-03-26 00:07:47,770 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 00:07:48,343 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-26 00:07:48,485 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-26 00:07:49,539 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 333 DAG size of output: 229 [2021-03-26 00:07:49,796 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-03-26 00:07:50,442 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:07:50,992 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-26 00:07:52,245 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:07:52,834 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:07:52,870 INFO L154 LiptonReduction]: Checked pairs total: 164 [2021-03-26 00:07:52,870 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:07:52,870 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5115 [2021-03-26 00:07:52,871 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 259 flow [2021-03-26 00:07:52,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:07:52,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:07:52,872 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] [2021-03-26 00:07:52,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:07:52,872 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:07:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:07:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash 329449642, now seen corresponding path program 2 times [2021-03-26 00:07:52,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:07:52,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136189455] [2021-03-26 00:07:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:07:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:07:52,918 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:07:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:07:52,954 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:07:52,997 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:07:52,998 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:07:52,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:07:53,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:07:53 BasicIcfg [2021-03-26 00:07:53,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:07:53,103 INFO L168 Benchmark]: Toolchain (without parser) took 21645.09 ms. Allocated memory was 255.9 MB in the beginning and 759.2 MB in the end (delta: 503.3 MB). Free memory was 233.6 MB in the beginning and 309.7 MB in the end (delta: -76.1 MB). Peak memory consumption was 428.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:07:53,103 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:07:53,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.20 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 233.6 MB in the beginning and 336.7 MB in the end (delta: -103.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:07:53,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.48 ms. Allocated memory is still 379.6 MB. Free memory was 336.7 MB in the beginning and 333.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:07:53,104 INFO L168 Benchmark]: Boogie Preprocessor took 57.55 ms. Allocated memory is still 379.6 MB. Free memory was 333.8 MB in the beginning and 331.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:07:53,104 INFO L168 Benchmark]: RCFGBuilder took 2139.74 ms. Allocated memory is still 379.6 MB. Free memory was 331.2 MB in the beginning and 294.9 MB in the end (delta: 36.3 MB). Peak memory consumption was 93.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:07:53,104 INFO L168 Benchmark]: TraceAbstraction took 18779.96 ms. Allocated memory was 379.6 MB in the beginning and 759.2 MB in the end (delta: 379.6 MB). Free memory was 294.9 MB in the beginning and 309.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 365.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:07:53,105 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 581.20 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 233.6 MB in the beginning and 336.7 MB in the end (delta: -103.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.48 ms. Allocated memory is still 379.6 MB. Free memory was 336.7 MB in the beginning and 333.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.55 ms. Allocated memory is still 379.6 MB. Free memory was 333.8 MB in the beginning and 331.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2139.74 ms. Allocated memory is still 379.6 MB. Free memory was 331.2 MB in the beginning and 294.9 MB in the end (delta: 36.3 MB). Peak memory consumption was 93.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18779.96 ms. Allocated memory was 379.6 MB in the beginning and 759.2 MB in the end (delta: 379.6 MB). Free memory was 294.9 MB in the beginning and 309.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 365.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3457.0ms, 122 PlacesBefore, 58 PlacesAfterwards, 111 TransitionsBefore, 46 TransitionsAfterwards, 2394 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 3759 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2008, positive: 1923, positive conditional: 1923, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1500, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1500, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1500, positive: 1452, positive conditional: 0, positive unconditional: 1452, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 597, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 554, negative conditional: 0, negative unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2008, positive: 461, positive conditional: 461, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 1500, unknown conditional: 1500, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 118, Positive conditional cache size: 118, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2036.7ms, 54 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 29 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 511, positive: 438, positive conditional: 438, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, positive: 165, positive conditional: 19, positive unconditional: 146, negative: 37, negative conditional: 2, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 202, positive: 165, positive conditional: 19, positive unconditional: 146, negative: 37, negative conditional: 2, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 202, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 37, negative conditional: 2, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 722, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 658, negative conditional: 58, negative unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, positive: 273, positive conditional: 273, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 202, unknown conditional: 202, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 174, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1757.5ms, 43 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 382, positive: 316, positive conditional: 316, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 10, positive unconditional: 15, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 10, positive unconditional: 15, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 149, negative conditional: 70, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 382, positive: 291, positive conditional: 291, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 199, Positive conditional cache size: 199, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 111, positive conditional: 111, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 209, Positive conditional cache size: 209, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 150.2ms, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 757 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 308, positive: 274, positive conditional: 274, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 52, positive conditional: 27, positive unconditional: 25, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, positive: 52, positive conditional: 27, positive unconditional: 25, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 308, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 56, unknown conditional: 56, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 234, Positive conditional cache size: 234, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 299.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 125 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 5, positive unconditional: 3, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 5, positive unconditional: 3, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 51, negative conditional: 45, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 242, Positive conditional cache size: 242, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 354.8ms, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 39, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 252, Positive conditional cache size: 252, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 390.6ms, 55 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 204, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 32, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 32, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, positive: 150, positive conditional: 150, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 270, Positive conditional cache size: 270, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 165.3ms, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 201, positive: 189, positive conditional: 189, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 34, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 34, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, positive: 153, positive conditional: 153, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 285, Positive conditional cache size: 285, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 193.2ms, 59 PlacesBefore, 59 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 16, positive unconditional: 2, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 16, positive unconditional: 2, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 88, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 303, Positive conditional cache size: 303, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1223.2ms, 67 PlacesBefore, 63 PlacesAfterwards, 46 TransitionsBefore, 43 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 167, positive: 149, positive conditional: 149, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, positive: 126, positive conditional: 126, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 294, Positive conditional cache size: 294, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.6ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 216 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 23, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 23, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 321, Positive conditional cache size: 321, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5114.6ms, 65 PlacesBefore, 63 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 164 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 23, positive conditional: 16, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 23, positive conditional: 16, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 155, Positive conditional cache size: 155, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t485; [L865] FCALL, FORK 0 pthread_create(&t485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t486; [L867] FCALL, FORK 0 pthread_create(&t486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t487; [L869] FCALL, FORK 0 pthread_create(&t487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t488; [L871] FCALL, FORK 0 pthread_create(&t488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L827] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18528.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1543.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3563.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 94 SDtfs, 45 SDslu, 48 SDs, 0 SdLazy, 228 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 247.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 220.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.2ms SsaConstructionTime, 442.9ms SatisfiabilityAnalysisTime, 762.6ms InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...