/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:30:25,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:30:25,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:30:25,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:30:25,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:30:25,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:30:25,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:30:25,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:30:25,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:30:25,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:30:25,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:30:25,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:30:25,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:30:25,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:30:25,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:30:25,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:30:25,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:30:25,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:30:25,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:30:25,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:30:25,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:30:25,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:30:25,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:30:25,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:30:25,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:30:25,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:30:25,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:30:25,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:30:25,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:30:25,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:30:25,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:30:25,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:30:25,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:30:25,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:30:25,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:30:25,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:30:25,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:30:25,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:30:25,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:30:25,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:30:25,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:30:25,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:30:25,267 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:30:25,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:30:25,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:30:25,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:30:25,271 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:30:25,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:30:25,272 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:30:25,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:30:25,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:30:25,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:30:25,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:30:25,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:30:25,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:30:25,273 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:30:25,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:30:25,273 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:30:25,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:30:25,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:30:25,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:30:25,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:30:25,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:30:25,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:30:25,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:30:25,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:30:25,276 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:30:25,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:30:25,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:30:25,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:30:25,615 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:30:25,616 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:30:25,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2021-03-26 10:30:25,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7428501/fb4b8d7bf4664062ab4838d67256d3a1/FLAGedfba6fbf [2021-03-26 10:30:26,343 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:30:26,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2021-03-26 10:30:26,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7428501/fb4b8d7bf4664062ab4838d67256d3a1/FLAGedfba6fbf [2021-03-26 10:30:26,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7428501/fb4b8d7bf4664062ab4838d67256d3a1 [2021-03-26 10:30:26,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:30:26,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:30:26,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:30:26,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:30:26,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:30:26,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:30:26" (1/1) ... [2021-03-26 10:30:26,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44255fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:26, skipping insertion in model container [2021-03-26 10:30:26,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:30:26" (1/1) ... [2021-03-26 10:30:26,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:30:26,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:30:26,884 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/safe008_pso.opt.i[949,962] [2021-03-26 10:30:27,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:30:27,096 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:30:27,113 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/safe008_pso.opt.i[949,962] [2021-03-26 10:30:27,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:30:27,231 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:30:27,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27 WrapperNode [2021-03-26 10:30:27,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:30:27,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:30:27,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:30:27,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:30:27,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:30:27,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:30:27,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:30:27,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:30:27,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... [2021-03-26 10:30:27,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:30:27,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:30:27,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:30:27,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:30:27,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:30:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:30:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:30:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:30:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:30:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:30:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:30:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:30:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:30:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:30:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:30:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:30:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:30:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:30:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:30:27,477 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:30:29,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:30:29,197 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:30:29,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:30:29 BoogieIcfgContainer [2021-03-26 10:30:29,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:30:29,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:30:29,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:30:29,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:30:29,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:30:26" (1/3) ... [2021-03-26 10:30:29,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d2f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:30:29, skipping insertion in model container [2021-03-26 10:30:29,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:30:27" (2/3) ... [2021-03-26 10:30:29,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d2f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:30:29, skipping insertion in model container [2021-03-26 10:30:29,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:30:29" (3/3) ... [2021-03-26 10:30:29,206 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_pso.opt.i [2021-03-26 10:30:29,211 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:30:29,215 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:30:29,216 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:30:29,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,248 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,248 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,248 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,252 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,252 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,256 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,262 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,262 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,265 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,265 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:30:29,270 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:30:29,285 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:30:29,303 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:30:29,303 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:30:29,304 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:30:29,304 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:30:29,304 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:30:29,304 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:30:29,304 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:30:29,304 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:30:29,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 10:30:29,344 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 10:30:29,345 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:30:29,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:30:29,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 10:30:29,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-26 10:30:29,354 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:29,365 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 10:30:29,368 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 10:30:29,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-26 10:30:29,386 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 10:30:29,386 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:30:29,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:30:29,389 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 10:30:30,369 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 10:30:30,681 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:30:32,163 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 10:30:32,791 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:30:33,831 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:30:34,181 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:30:34,301 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:30:35,503 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:30:35,802 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:30:36,405 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:30:36,987 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:30:37,139 INFO L154 LiptonReduction]: Checked pairs total: 3189 [2021-03-26 10:30:37,139 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 10:30:37,141 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7788 [2021-03-26 10:30:37,148 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 10:30:37,148 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:30:37,148 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:37,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:37,149 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash -351657079, now seen corresponding path program 1 times [2021-03-26 10:30:37,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:37,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575959034] [2021-03-26 10:30:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:37,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:37,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:30:37,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:37,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:37,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575959034] [2021-03-26 10:30:37,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:37,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:30:37,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807903401] [2021-03-26 10:30:37,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:30:37,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:30:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:30:37,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 162 [2021-03-26 10:30:37,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:37,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:37,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 162 [2021-03-26 10:30:37,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:37,540 INFO L129 PetriNetUnfolder]: 69/188 cut-off events. [2021-03-26 10:30:37,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:30:37,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 188 events. 69/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 906 event pairs, 13 based on Foata normal form. 11/181 useless extension candidates. Maximal degree in co-relation 294. Up to 89 conditions per place. [2021-03-26 10:30:37,544 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 9 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2021-03-26 10:30:37,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 121 flow [2021-03-26 10:30:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:30:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:30:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 10:30:37,564 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8847736625514403 [2021-03-26 10:30:37,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 10:30:37,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 10:30:37,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:37,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 10:30:37,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:37,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:37,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:37,588 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 430 transitions. [2021-03-26 10:30:37,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 121 flow [2021-03-26 10:30:37,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:30:37,593 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 80 flow [2021-03-26 10:30:37,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-26 10:30:37,595 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 10:30:37,595 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:37,595 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 80 flow [2021-03-26 10:30:37,596 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 80 flow [2021-03-26 10:30:37,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 10:30:37,601 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:30:37,601 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:30:37,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:30:37,601 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:30:38,039 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:30:38,332 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:30:38,903 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:30:39,446 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:30:40,440 INFO L154 LiptonReduction]: Checked pairs total: 1218 [2021-03-26 10:30:40,440 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:30:40,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2845 [2021-03-26 10:30:40,441 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:30:40,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:40,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:40,442 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 10:30:40,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:30:40,443 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1437678712, now seen corresponding path program 1 times [2021-03-26 10:30:40,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:40,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970507243] [2021-03-26 10:30:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:40,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:40,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:30:40,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:40,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:40,567 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:30:40,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:30:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:40,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970507243] [2021-03-26 10:30:40,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:40,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:30:40,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753289101] [2021-03-26 10:30:40,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:30:40,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:30:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:30:40,574 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 10:30:40,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:40,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:40,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 10:30:40,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:40,587 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:30:40,587 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:30:40,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:30:40,587 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 10:30:40,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 10:30:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:30:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:30:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 10:30:40,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805394990366089 [2021-03-26 10:30:40,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 10:30:40,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 10:30:40,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:40,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 10:30:40,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:40,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:40,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:40,592 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 457 transitions. [2021-03-26 10:30:40,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 10:30:40,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:30:40,593 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 10:30:40,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 10:30:40,594 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 10:30:40,594 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:40,594 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:30:40,595 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:30:40,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 10:30:40,598 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:30:40,598 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:30:40,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:30:40,598 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 10:30:41,165 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:30:41,294 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:30:41,586 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:30:41,718 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:30:41,722 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 10:30:41,722 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:30:41,722 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1128 [2021-03-26 10:30:41,723 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:30:41,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:41,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:41,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:41,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:30:41,724 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1821539996, now seen corresponding path program 1 times [2021-03-26 10:30:41,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:41,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380155701] [2021-03-26 10:30:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:41,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:41,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:30:41,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:41,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:41,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:41,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:41,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380155701] [2021-03-26 10:30:41,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:41,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:30:41,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961794283] [2021-03-26 10:30:41,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:30:41,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:30:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:30:41,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 175 [2021-03-26 10:30:41,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:41,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:41,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 175 [2021-03-26 10:30:41,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:41,851 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:30:41,851 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-26 10:30:41,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 28 events. 0/28 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:30:41,852 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 1 selfloop transitions, 3 changer transitions 1/22 dead transitions. [2021-03-26 10:30:41,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 71 flow [2021-03-26 10:30:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:30:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:30:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2021-03-26 10:30:41,854 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8728571428571429 [2021-03-26 10:30:41,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 611 transitions. [2021-03-26 10:30:41,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 611 transitions. [2021-03-26 10:30:41,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:41,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 611 transitions. [2021-03-26 10:30:41,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:41,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:41,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:41,858 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 611 transitions. [2021-03-26 10:30:41,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 71 flow [2021-03-26 10:30:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 65 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:30:41,859 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 66 flow [2021-03-26 10:30:41,859 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 10:30:41,860 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 10:30:41,860 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:41,860 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 66 flow [2021-03-26 10:30:41,860 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 66 flow [2021-03-26 10:30:41,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 66 flow [2021-03-26 10:30:41,863 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:30:41,863 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:30:41,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:30:41,864 INFO L142 LiptonReduction]: Number of co-enabled transitions 194 [2021-03-26 10:30:41,979 INFO L154 LiptonReduction]: Checked pairs total: 414 [2021-03-26 10:30:41,980 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:30:41,980 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-26 10:30:41,981 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 64 flow [2021-03-26 10:30:41,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:41,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:41,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:41,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:30:41,982 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash -821153322, now seen corresponding path program 1 times [2021-03-26 10:30:41,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:41,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115274468] [2021-03-26 10:30:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:42,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:42,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:42,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:42,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:42,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115274468] [2021-03-26 10:30:42,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:42,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:30:42,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996574414] [2021-03-26 10:30:42,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:30:42,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:30:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:30:42,052 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-26 10:30:42,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:42,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-26 10:30:42,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:42,076 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 10:30:42,076 INFO L130 PetriNetUnfolder]: For 23/33 co-relation queries the response was YES. [2021-03-26 10:30:42,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 30 events. 0/30 cut-off events. For 23/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 3/33 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:30:42,077 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 1 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2021-03-26 10:30:42,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 80 flow [2021-03-26 10:30:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:30:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:30:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-03-26 10:30:42,079 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8508522727272727 [2021-03-26 10:30:42,079 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-03-26 10:30:42,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-03-26 10:30:42,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:42,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-03-26 10:30:42,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,083 INFO L185 Difference]: Start difference. First operand has 33 places, 20 transitions, 64 flow. Second operand 4 states and 599 transitions. [2021-03-26 10:30:42,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 80 flow [2021-03-26 10:30:42,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 65 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:30:42,086 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 66 flow [2021-03-26 10:30:42,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-26 10:30:42,087 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 10:30:42,087 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:42,087 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 66 flow [2021-03-26 10:30:42,088 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 66 flow [2021-03-26 10:30:42,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 66 flow [2021-03-26 10:30:42,093 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 10:30:42,094 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 10:30:42,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 20 events. 0/20 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:30:42,094 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 10:30:42,230 INFO L154 LiptonReduction]: Checked pairs total: 281 [2021-03-26 10:30:42,230 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:30:42,230 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 143 [2021-03-26 10:30:42,231 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 64 flow [2021-03-26 10:30:42,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:42,232 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:42,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:30:42,232 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash 917533105, now seen corresponding path program 1 times [2021-03-26 10:30:42,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:42,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431871186] [2021-03-26 10:30:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:42,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:42,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:30:42,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:42,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:30:42,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:42,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:30:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:42,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431871186] [2021-03-26 10:30:42,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:42,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:30:42,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182155213] [2021-03-26 10:30:42,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:30:42,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:30:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:30:42,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 177 [2021-03-26 10:30:42,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:42,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 177 [2021-03-26 10:30:42,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:42,383 INFO L129 PetriNetUnfolder]: 54/117 cut-off events. [2021-03-26 10:30:42,383 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2021-03-26 10:30:42,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 117 events. 54/117 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 360 event pairs, 21 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 260. Up to 89 conditions per place. [2021-03-26 10:30:42,385 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 9 selfloop transitions, 9 changer transitions 0/29 dead transitions. [2021-03-26 10:30:42,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 124 flow [2021-03-26 10:30:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:30:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:30:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2021-03-26 10:30:42,388 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.768361581920904 [2021-03-26 10:30:42,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2021-03-26 10:30:42,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2021-03-26 10:30:42,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:42,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2021-03-26 10:30:42,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:42,393 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 64 flow. Second operand 5 states and 680 transitions. [2021-03-26 10:30:42,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 124 flow [2021-03-26 10:30:42,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 109 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:30:42,395 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 114 flow [2021-03-26 10:30:42,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-26 10:30:42,395 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2021-03-26 10:30:42,395 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:42,395 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 114 flow [2021-03-26 10:30:42,396 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 114 flow [2021-03-26 10:30:42,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 114 flow [2021-03-26 10:30:42,405 INFO L129 PetriNetUnfolder]: 12/67 cut-off events. [2021-03-26 10:30:42,405 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-03-26 10:30:42,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 67 events. 12/67 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 250 event pairs, 4 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 142. Up to 19 conditions per place. [2021-03-26 10:30:42,408 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 10:30:42,570 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 10:30:42,799 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 10:30:43,062 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:30:43,378 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:30:43,747 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:30:43,856 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:30:43,861 INFO L154 LiptonReduction]: Checked pairs total: 185 [2021-03-26 10:30:43,861 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:30:43,861 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1466 [2021-03-26 10:30:43,862 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 123 flow [2021-03-26 10:30:43,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:43,863 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:43,863 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:43,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:30:43,863 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 316192968, now seen corresponding path program 1 times [2021-03-26 10:30:43,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:43,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870561113] [2021-03-26 10:30:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:43,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:43,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:30:43,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:43,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:30:43,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:43,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:30:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:43,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870561113] [2021-03-26 10:30:43,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:43,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:30:43,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352815340] [2021-03-26 10:30:43,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:30:43,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:43,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:30:43,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:30:43,980 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 181 [2021-03-26 10:30:43,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:43,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:43,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 181 [2021-03-26 10:30:43,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:44,065 INFO L129 PetriNetUnfolder]: 50/112 cut-off events. [2021-03-26 10:30:44,065 INFO L130 PetriNetUnfolder]: For 104/118 co-relation queries the response was YES. [2021-03-26 10:30:44,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 112 events. 50/112 cut-off events. For 104/118 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 369 event pairs, 19 based on Foata normal form. 7/111 useless extension candidates. Maximal degree in co-relation 341. Up to 85 conditions per place. [2021-03-26 10:30:44,066 INFO L132 encePairwiseOnDemand]: 172/181 looper letters, 10 selfloop transitions, 10 changer transitions 0/31 dead transitions. [2021-03-26 10:30:44,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 179 flow [2021-03-26 10:30:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:30:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:30:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2021-03-26 10:30:44,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7693370165745856 [2021-03-26 10:30:44,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2021-03-26 10:30:44,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2021-03-26 10:30:44,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:44,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2021-03-26 10:30:44,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,072 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 123 flow. Second operand 4 states and 557 transitions. [2021-03-26 10:30:44,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 179 flow [2021-03-26 10:30:44,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 175 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 10:30:44,073 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 167 flow [2021-03-26 10:30:44,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-03-26 10:30:44,074 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 10:30:44,074 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:44,074 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 167 flow [2021-03-26 10:30:44,074 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 167 flow [2021-03-26 10:30:44,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 167 flow [2021-03-26 10:30:44,088 INFO L129 PetriNetUnfolder]: 37/104 cut-off events. [2021-03-26 10:30:44,089 INFO L130 PetriNetUnfolder]: For 154/168 co-relation queries the response was YES. [2021-03-26 10:30:44,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 104 events. 37/104 cut-off events. For 154/168 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 400 event pairs, 11 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 302. Up to 58 conditions per place. [2021-03-26 10:30:44,090 INFO L142 LiptonReduction]: Number of co-enabled transitions 154 [2021-03-26 10:30:44,117 INFO L154 LiptonReduction]: Checked pairs total: 125 [2021-03-26 10:30:44,117 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:30:44,118 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 10:30:44,119 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 169 flow [2021-03-26 10:30:44,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:44,119 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:44,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:30:44,119 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash 341755011, now seen corresponding path program 1 times [2021-03-26 10:30:44,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:44,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152924618] [2021-03-26 10:30:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:44,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:30:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:44,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152924618] [2021-03-26 10:30:44,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:44,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:30:44,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198911089] [2021-03-26 10:30:44,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:30:44,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:30:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:30:44,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-03-26 10:30:44,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:44,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-03-26 10:30:44,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:44,271 INFO L129 PetriNetUnfolder]: 76/190 cut-off events. [2021-03-26 10:30:44,271 INFO L130 PetriNetUnfolder]: For 171/175 co-relation queries the response was YES. [2021-03-26 10:30:44,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 190 events. 76/190 cut-off events. For 171/175 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 962 event pairs, 29 based on Foata normal form. 20/195 useless extension candidates. Maximal degree in co-relation 494. Up to 99 conditions per place. [2021-03-26 10:30:44,274 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 8 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-03-26 10:30:44,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 185 flow [2021-03-26 10:30:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:30:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:30:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2021-03-26 10:30:44,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494505494505494 [2021-03-26 10:30:44,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2021-03-26 10:30:44,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2021-03-26 10:30:44,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:44,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2021-03-26 10:30:44,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,285 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 169 flow. Second operand 5 states and 773 transitions. [2021-03-26 10:30:44,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 185 flow [2021-03-26 10:30:44,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 162 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-26 10:30:44,290 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 170 flow [2021-03-26 10:30:44,291 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=110, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-26 10:30:44,291 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2021-03-26 10:30:44,291 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:44,291 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 170 flow [2021-03-26 10:30:44,291 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 170 flow [2021-03-26 10:30:44,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 170 flow [2021-03-26 10:30:44,318 INFO L129 PetriNetUnfolder]: 81/192 cut-off events. [2021-03-26 10:30:44,318 INFO L130 PetriNetUnfolder]: For 206/224 co-relation queries the response was YES. [2021-03-26 10:30:44,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 192 events. 81/192 cut-off events. For 206/224 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 944 event pairs, 39 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 577. Up to 96 conditions per place. [2021-03-26 10:30:44,321 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-26 10:30:44,325 INFO L154 LiptonReduction]: Checked pairs total: 13 [2021-03-26 10:30:44,325 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:30:44,325 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 10:30:44,332 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 164 flow [2021-03-26 10:30:44,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,333 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:44,333 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:44,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:30:44,333 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:44,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1004307828, now seen corresponding path program 1 times [2021-03-26 10:30:44,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:44,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492134681] [2021-03-26 10:30:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:44,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:30:44,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:30:44,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:30:44,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:30:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:44,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492134681] [2021-03-26 10:30:44,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:44,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:30:44,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100093361] [2021-03-26 10:30:44,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:30:44,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:30:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:30:44,498 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-03-26 10:30:44,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:44,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-03-26 10:30:44,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:44,658 INFO L129 PetriNetUnfolder]: 125/274 cut-off events. [2021-03-26 10:30:44,658 INFO L130 PetriNetUnfolder]: For 510/540 co-relation queries the response was YES. [2021-03-26 10:30:44,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 274 events. 125/274 cut-off events. For 510/540 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1371 event pairs, 36 based on Foata normal form. 19/270 useless extension candidates. Maximal degree in co-relation 950. Up to 130 conditions per place. [2021-03-26 10:30:44,660 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 7 selfloop transitions, 11 changer transitions 0/32 dead transitions. [2021-03-26 10:30:44,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 206 flow [2021-03-26 10:30:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:30:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:30:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2021-03-26 10:30:44,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7133699633699634 [2021-03-26 10:30:44,663 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2021-03-26 10:30:44,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2021-03-26 10:30:44,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:44,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2021-03-26 10:30:44,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,667 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,668 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 164 flow. Second operand 6 states and 779 transitions. [2021-03-26 10:30:44,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 206 flow [2021-03-26 10:30:44,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 191 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 10:30:44,671 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 182 flow [2021-03-26 10:30:44,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-26 10:30:44,671 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2021-03-26 10:30:44,671 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:44,671 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 30 transitions, 182 flow [2021-03-26 10:30:44,671 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 182 flow [2021-03-26 10:30:44,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 182 flow [2021-03-26 10:30:44,736 INFO L129 PetriNetUnfolder]: 96/237 cut-off events. [2021-03-26 10:30:44,736 INFO L130 PetriNetUnfolder]: For 294/336 co-relation queries the response was YES. [2021-03-26 10:30:44,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 237 events. 96/237 cut-off events. For 294/336 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1248 event pairs, 40 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 706. Up to 130 conditions per place. [2021-03-26 10:30:44,739 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-26 10:30:44,741 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:30:44,741 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:30:44,741 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 70 [2021-03-26 10:30:44,742 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 182 flow [2021-03-26 10:30:44,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,743 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:44,743 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:44,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:30:44,743 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1446787284, now seen corresponding path program 1 times [2021-03-26 10:30:44,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:44,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019905358] [2021-03-26 10:30:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:44,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:30:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:44,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019905358] [2021-03-26 10:30:44,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:44,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:30:44,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719755933] [2021-03-26 10:30:44,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:30:44,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:30:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:30:44,820 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-03-26 10:30:44,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:44,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-03-26 10:30:44,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:44,877 INFO L129 PetriNetUnfolder]: 64/177 cut-off events. [2021-03-26 10:30:44,877 INFO L130 PetriNetUnfolder]: For 225/338 co-relation queries the response was YES. [2021-03-26 10:30:44,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 177 events. 64/177 cut-off events. For 225/338 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 840 event pairs, 5 based on Foata normal form. 48/215 useless extension candidates. Maximal degree in co-relation 633. Up to 117 conditions per place. [2021-03-26 10:30:44,880 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 10 changer transitions 4/40 dead transitions. [2021-03-26 10:30:44,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 278 flow [2021-03-26 10:30:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:30:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:30:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions. [2021-03-26 10:30:44,883 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8489010989010989 [2021-03-26 10:30:44,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 927 transitions. [2021-03-26 10:30:44,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions. [2021-03-26 10:30:44,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:44,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions. [2021-03-26 10:30:44,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,888 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 182 flow. Second operand 6 states and 927 transitions. [2021-03-26 10:30:44,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 278 flow [2021-03-26 10:30:44,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 266 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:30:44,891 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 250 flow [2021-03-26 10:30:44,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-26 10:30:44,891 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2021-03-26 10:30:44,891 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:44,891 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 250 flow [2021-03-26 10:30:44,892 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 250 flow [2021-03-26 10:30:44,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 250 flow [2021-03-26 10:30:44,910 INFO L129 PetriNetUnfolder]: 41/154 cut-off events. [2021-03-26 10:30:44,910 INFO L130 PetriNetUnfolder]: For 339/388 co-relation queries the response was YES. [2021-03-26 10:30:44,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 41/154 cut-off events. For 339/388 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 818 event pairs, 6 based on Foata normal form. 3/151 useless extension candidates. Maximal degree in co-relation 602. Up to 95 conditions per place. [2021-03-26 10:30:44,912 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 10:30:44,918 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-26 10:30:44,918 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:30:44,918 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-26 10:30:44,918 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 242 flow [2021-03-26 10:30:44,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:44,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:44,919 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:44,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:30:44,919 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1864536532, now seen corresponding path program 1 times [2021-03-26 10:30:44,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:44,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506437685] [2021-03-26 10:30:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:30:44,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:30:44,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:30:44,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:30:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:30:45,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506437685] [2021-03-26 10:30:45,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:30:45,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:30:45,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467557548] [2021-03-26 10:30:45,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:30:45,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:30:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:30:45,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:30:45,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-03-26 10:30:45,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:45,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:30:45,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-03-26 10:30:45,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:30:45,053 INFO L129 PetriNetUnfolder]: 25/95 cut-off events. [2021-03-26 10:30:45,053 INFO L130 PetriNetUnfolder]: For 249/307 co-relation queries the response was YES. [2021-03-26 10:30:45,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 95 events. 25/95 cut-off events. For 249/307 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 372 event pairs, 0 based on Foata normal form. 32/122 useless extension candidates. Maximal degree in co-relation 405. Up to 58 conditions per place. [2021-03-26 10:30:45,054 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 2 selfloop transitions, 11 changer transitions 3/37 dead transitions. [2021-03-26 10:30:45,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 286 flow [2021-03-26 10:30:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:30:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:30:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1075 transitions. [2021-03-26 10:30:45,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8437990580847724 [2021-03-26 10:30:45,057 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1075 transitions. [2021-03-26 10:30:45,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1075 transitions. [2021-03-26 10:30:45,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:30:45,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1075 transitions. [2021-03-26 10:30:45,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.57142857142858) internal successors, (1075), 7 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:45,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:45,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:45,063 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 242 flow. Second operand 7 states and 1075 transitions. [2021-03-26 10:30:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 286 flow [2021-03-26 10:30:45,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 252 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-26 10:30:45,067 INFO L241 Difference]: Finished difference. Result has 51 places, 34 transitions, 232 flow [2021-03-26 10:30:45,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2021-03-26 10:30:45,068 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2021-03-26 10:30:45,068 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:30:45,068 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 34 transitions, 232 flow [2021-03-26 10:30:45,068 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 34 transitions, 232 flow [2021-03-26 10:30:45,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 34 transitions, 232 flow [2021-03-26 10:30:45,078 INFO L129 PetriNetUnfolder]: 21/89 cut-off events. [2021-03-26 10:30:45,078 INFO L130 PetriNetUnfolder]: For 166/179 co-relation queries the response was YES. [2021-03-26 10:30:45,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 89 events. 21/89 cut-off events. For 166/179 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 0 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 338. Up to 35 conditions per place. [2021-03-26 10:30:45,079 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 10:30:45,413 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:30:45,525 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:30:46,113 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-26 10:30:46,328 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:30:47,577 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 347 DAG size of output: 268 [2021-03-26 10:30:48,044 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2021-03-26 10:30:48,048 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-26 10:30:48,048 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:30:48,048 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2980 [2021-03-26 10:30:48,049 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 216 flow [2021-03-26 10:30:48,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:30:48,049 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:30:48,049 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:30:48,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:30:48,049 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:30:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:30:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash -308536075, now seen corresponding path program 1 times [2021-03-26 10:30:48,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:30:48,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462147476] [2021-03-26 10:30:48,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:30:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:30:48,091 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:30:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:30:48,131 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:30:48,156 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:30:48,156 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:30:48,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:30:48,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:30:48 BasicIcfg [2021-03-26 10:30:48,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:30:48,208 INFO L168 Benchmark]: Toolchain (without parser) took 21521.53 ms. Allocated memory was 255.9 MB in the beginning and 627.0 MB in the end (delta: 371.2 MB). Free memory was 234.9 MB in the beginning and 277.5 MB in the end (delta: -42.6 MB). Peak memory consumption was 327.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:30:48,209 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 157.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:30:48,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.21 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.9 MB in the beginning and 320.0 MB in the end (delta: -85.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:30:48,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.08 ms. Allocated memory is still 360.7 MB. Free memory was 319.6 MB in the beginning and 317.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:30:48,209 INFO L168 Benchmark]: Boogie Preprocessor took 68.63 ms. Allocated memory is still 360.7 MB. Free memory was 317.2 MB in the beginning and 314.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:30:48,210 INFO L168 Benchmark]: RCFGBuilder took 1809.30 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 314.8 MB in the beginning and 401.5 MB in the end (delta: -86.7 MB). Peak memory consumption was 64.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:30:48,210 INFO L168 Benchmark]: TraceAbstraction took 19007.21 ms. Allocated memory was 434.1 MB in the beginning and 627.0 MB in the end (delta: 192.9 MB). Free memory was 400.4 MB in the beginning and 277.5 MB in the end (delta: 122.9 MB). Peak memory consumption was 314.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:30:48,212 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.15 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 157.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 543.21 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.9 MB in the beginning and 320.0 MB in the end (delta: -85.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 86.08 ms. Allocated memory is still 360.7 MB. Free memory was 319.6 MB in the beginning and 317.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 68.63 ms. Allocated memory is still 360.7 MB. Free memory was 317.2 MB in the beginning and 314.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1809.30 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 314.8 MB in the beginning and 401.5 MB in the end (delta: -86.7 MB). Peak memory consumption was 64.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19007.21 ms. Allocated memory was 434.1 MB in the beginning and 627.0 MB in the end (delta: 192.9 MB). Free memory was 400.4 MB in the beginning and 277.5 MB in the end (delta: 122.9 MB). Peak memory consumption was 314.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: 7771.5ms, 103 PlacesBefore, 50 PlacesAfterwards, 95 TransitionsBefore, 41 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3189 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1640, positive: 1555, positive conditional: 1555, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1640, positive: 1555, positive conditional: 0, positive unconditional: 1555, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1640, positive: 1555, positive conditional: 0, positive unconditional: 1555, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1218, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1218, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 547, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 518, negative conditional: 0, negative unconditional: 518, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1640, positive: 374, positive conditional: 0, positive unconditional: 374, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 1218, unknown conditional: 0, unknown unconditional: 1218] , Statistics on independence cache: Total cache size (in pairs): 1218, Positive cache size: 1181, Positive conditional cache size: 0, Positive unconditional cache size: 1181, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2844.6ms, 47 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1218 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 329, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 329, positive: 242, positive conditional: 30, positive unconditional: 212, negative: 87, negative conditional: 11, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 329, positive: 242, positive conditional: 30, positive unconditional: 212, negative: 87, negative conditional: 11, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 35, positive conditional: 2, positive unconditional: 33, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 345, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 345, negative conditional: 47, negative unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 329, positive: 207, positive conditional: 28, positive unconditional: 179, negative: 70, negative conditional: 8, negative unconditional: 62, unknown: 52, unknown conditional: 5, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 1270, Positive cache size: 1216, Positive conditional cache size: 2, Positive unconditional cache size: 1214, Negative cache size: 54, Negative conditional cache size: 3, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1127.3ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, positive: 213, positive conditional: 213, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, positive: 213, positive conditional: 0, positive unconditional: 213, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, positive: 213, positive conditional: 0, positive unconditional: 213, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 273, positive: 189, positive conditional: 0, positive unconditional: 189, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 1301, Positive cache size: 1240, Positive conditional cache size: 2, Positive unconditional cache size: 1238, Negative cache size: 61, Negative conditional cache size: 3, Negative unconditional cache size: 58, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.6ms, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 414 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, positive: 106, positive conditional: 106, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1253, Positive conditional cache size: 2, Positive unconditional cache size: 1251, Negative cache size: 66, Negative conditional cache size: 3, Negative unconditional cache size: 63, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 142.1ms, 34 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 281 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 14, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1333, Positive cache size: 1265, Positive conditional cache size: 2, Positive unconditional cache size: 1263, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1465.5ms, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, positive: 114, positive conditional: 21, positive unconditional: 93, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 114, positive conditional: 21, positive unconditional: 93, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 7, positive unconditional: 7, 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: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 100, positive conditional: 14, positive unconditional: 86, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 14, unknown conditional: 7, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1347, Positive cache size: 1279, Positive conditional cache size: 9, Positive unconditional cache size: 1270, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.4ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 125 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, positive: 79, positive conditional: 7, positive unconditional: 72, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 79, positive conditional: 7, positive unconditional: 72, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 76, positive conditional: 5, positive unconditional: 71, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1282, Positive conditional cache size: 11, Positive unconditional cache size: 1271, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.1ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 13 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 13, positive conditional: 9, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 9, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1355, Positive cache size: 1287, Positive conditional cache size: 13, Positive unconditional cache size: 1274, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.7ms, 43 PlacesBefore, 43 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1355, Positive cache size: 1287, Positive conditional cache size: 13, Positive unconditional cache size: 1274, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.1ms, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1356, Positive cache size: 1288, Positive conditional cache size: 14, Positive unconditional cache size: 1274, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2979.7ms, 51 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 30 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 21, positive conditional: 16, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 16, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 19, positive conditional: 14, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1290, Positive conditional cache size: 16, Positive unconditional cache size: 1274, Negative cache size: 68, Negative conditional cache size: 3, Negative unconditional cache size: 65, Eliminated conditions: 5 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1970; [L821] FCALL, FORK 0 pthread_create(&t1970, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1971; [L823] FCALL, FORK 0 pthread_create(&t1971, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1972; [L825] FCALL, FORK 0 pthread_create(&t1972, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y [L795] 3 z = 1 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] 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) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] 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) [L831] 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) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 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 [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 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 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18857.2ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 834.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7841.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 36 SDtfs, 15 SDslu, 14 SDs, 0 SdLazy, 231 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 248.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 193.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.5ms SsaConstructionTime, 373.5ms SatisfiabilityAnalysisTime, 664.8ms InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...