/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/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:24:44,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:24:44,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:24:44,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:24:44,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:24:44,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:24:44,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:24:44,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:24:44,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:24:44,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:24:44,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:24:44,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:24:44,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:24:44,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:24:44,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:24:44,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:24:44,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:24:44,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:24:44,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:24:44,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:24:44,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:24:44,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:24:44,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:24:44,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:24:44,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:24:44,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:24:44,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:24:44,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:24:44,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:24:44,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:24:44,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:24:44,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:24:44,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:24:44,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:24:44,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:24:44,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:24:44,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:24:44,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:24:44,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:24:44,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:24:44,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:24:44,318 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-06-11 16:24:44,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:24:44,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:24:44,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:24:44,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:24:44,338 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:24:44,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:24:44,339 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:24:44,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:24:44,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:24:44,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:24:44,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:24:44,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:24:44,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:24:44,340 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:24:44,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:24:44,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:24:44,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:24:44,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:24:44,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:24:44,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:24:44,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:24:44,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:24:44,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:24:44,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:24:44,343 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-06-11 16:24:44,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:24:44,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:24:44,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:24:44,668 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:24:44,668 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:24:44,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-06-11 16:24:44,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5ab02a9/b21de8ceafb74d67b8c2d9b8f6f758af/FLAGbf7ee7817 [2021-06-11 16:24:45,214 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:24:45,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-06-11 16:24:45,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5ab02a9/b21de8ceafb74d67b8c2d9b8f6f758af/FLAGbf7ee7817 [2021-06-11 16:24:45,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5ab02a9/b21de8ceafb74d67b8c2d9b8f6f758af [2021-06-11 16:24:45,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:24:45,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:24:45,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:24:45,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:24:45,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:24:45,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:24:45" (1/1) ... [2021-06-11 16:24:45,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c2c8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:45, skipping insertion in model container [2021-06-11 16:24:45,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:24:45" (1/1) ... [2021-06-11 16:24:45,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:24:45,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:24:45,966 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/safe029_rmo.oepc.i[950,963] [2021-06-11 16:24:46,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:24:46,174 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:24:46,187 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/safe029_rmo.oepc.i[950,963] [2021-06-11 16:24:46,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:24:46,304 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:24:46,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46 WrapperNode [2021-06-11 16:24:46,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:24:46,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:24:46,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:24:46,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:24:46,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:24:46,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:24:46,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:24:46,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:24:46,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (1/1) ... [2021-06-11 16:24:46,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:24:46,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:24:46,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:24:46,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:24:46,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (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-06-11 16:24:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:24:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:24:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:24:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:24:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:24:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:24:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:24:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:24:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:24:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:24:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:24:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:24:46,516 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:24:48,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:24:48,263 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:24:48,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:24:48 BoogieIcfgContainer [2021-06-11 16:24:48,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:24:48,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:24:48,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:24:48,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:24:48,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:24:45" (1/3) ... [2021-06-11 16:24:48,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a276c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:24:48, skipping insertion in model container [2021-06-11 16:24:48,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:24:46" (2/3) ... [2021-06-11 16:24:48,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a276c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:24:48, skipping insertion in model container [2021-06-11 16:24:48,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:24:48" (3/3) ... [2021-06-11 16:24:48,271 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2021-06-11 16:24:48,279 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:24:48,282 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:24:48,283 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:24:48,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:24:48,332 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:24:48,346 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 16:24:48,377 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:24:48,377 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:24:48,377 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:24:48,377 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:24:48,377 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:24:48,378 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:24:48,378 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:24:48,378 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:24:48,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-06-11 16:24:48,424 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-06-11 16:24:48,425 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:24:48,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 16:24:48,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-06-11 16:24:48,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-06-11 16:24:48,443 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:24:48,454 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-06-11 16:24:48,457 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-06-11 16:24:48,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-06-11 16:24:48,471 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-06-11 16:24:48,471 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:24:48,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 16:24:48,474 INFO L151 LiptonReduction]: Number of co-enabled transitions 926 [2021-06-11 16:24:48,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:48,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,949 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:24:48,949 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:24:48,969 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:48,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:49,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:49,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:49,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:49,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:24:49,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:24:50,063 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-06-11 16:24:50,374 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 16:24:51,847 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-06-11 16:24:52,442 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 16:24:52,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:52,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:24:52,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:24:52,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:52,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:24:52,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:24:52,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:52,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:52,993 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 16:24:52,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:53,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:53,529 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:24:53,929 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 16:24:54,045 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 16:24:54,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:54,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:24:54,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:54,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,065 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 16:24:54,065 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:24:54,067 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,070 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 16:24:54,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:54,073 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 16:24:54,073 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 16:24:54,074 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:24:54,075 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,077 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 16:24:54,078 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 16:24:54,078 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:24:54,079 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,082 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 16:24:54,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:54,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:54,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:54,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:24:54,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:54,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 16:24:54,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:24:54,965 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-06-11 16:24:55,304 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 16:24:55,918 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 16:24:56,560 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 16:24:56,918 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 16:24:57,219 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 16:24:57,777 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 16:24:58,352 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 16:24:58,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:58,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:58,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:58,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:58,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:58,540 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:24:58,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:58,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:58,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:58,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:58,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:24:58,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:24:59,212 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 16:24:59,498 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 16:25:00,620 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-06-11 16:25:01,226 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 16:25:01,569 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 16:25:01,903 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 16:25:02,579 WARN L205 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 16:25:03,185 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 16:25:03,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:25:03,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:25:03,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:25:03,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:25:03,440 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-06-11 16:25:03,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:25:03,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:25:03,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:25:03,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:25:03,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:03,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:25:03,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:25:04,125 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-11 16:25:04,247 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-11 16:25:04,510 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-11 16:25:04,627 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-11 16:25:04,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:04,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:25:04,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:04,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:25:04,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:25:04,661 INFO L163 LiptonReduction]: Checked pairs total: 2570 [2021-06-11 16:25:04,661 INFO L165 LiptonReduction]: Total number of compositions: 74 [2021-06-11 16:25:04,663 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16221 [2021-06-11 16:25:04,669 INFO L129 PetriNetUnfolder]: 0/5 cut-off events. [2021-06-11 16:25:04,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:25:04,669 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:04,670 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 16:25:04,670 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 915118, now seen corresponding path program 1 times [2021-06-11 16:25:04,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:04,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235732151] [2021-06-11 16:25:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:04,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:04,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:25:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:04,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235732151] [2021-06-11 16:25:04,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:04,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:25:04,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277401129] [2021-06-11 16:25:04,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:25:04,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:04,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:25:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:25:04,839 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2021-06-11 16:25:04,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:04,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:04,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2021-06-11 16:25:04,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:04,905 INFO L129 PetriNetUnfolder]: 23/61 cut-off events. [2021-06-11 16:25:04,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:25:04,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 61 events. 23/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 214 event pairs, 16 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 107. Up to 37 conditions per place. [2021-06-11 16:25:04,908 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 7 selfloop transitions, 2 changer transitions 3/22 dead transitions. [2021-06-11 16:25:04,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 72 flow [2021-06-11 16:25:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:25:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:25:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-06-11 16:25:04,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2021-06-11 16:25:04,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-06-11 16:25:04,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-06-11 16:25:04,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:04,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-06-11 16:25:04,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:04,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:04,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:04,944 INFO L185 Difference]: Start difference. First operand has 27 places, 22 transitions, 50 flow. Second operand 3 states and 369 transitions. [2021-06-11 16:25:04,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 72 flow [2021-06-11 16:25:04,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:25:04,948 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2021-06-11 16:25:04,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-06-11 16:25:04,949 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2021-06-11 16:25:04,949 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:04,949 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2021-06-11 16:25:04,950 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 40 flow [2021-06-11 16:25:04,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2021-06-11 16:25:04,953 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 16:25:04,953 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:25:04,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 16:25:04,954 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 16:25:05,161 INFO L163 LiptonReduction]: Checked pairs total: 120 [2021-06-11 16:25:05,161 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:25:05,162 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 213 [2021-06-11 16:25:05,162 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-06-11 16:25:05,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,163 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:05,163 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:05,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 16:25:05,163 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:05,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -922098124, now seen corresponding path program 1 times [2021-06-11 16:25:05,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:05,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762503933] [2021-06-11 16:25:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:05,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:05,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:25:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:05,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762503933] [2021-06-11 16:25:05,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:05,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:25:05,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438578878] [2021-06-11 16:25:05,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:25:05,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:05,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:25:05,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:25:05,287 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 153 [2021-06-11 16:25:05,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:05,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 153 [2021-06-11 16:25:05,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:05,303 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-06-11 16:25:05,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:25:05,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-06-11 16:25:05,303 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 3 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2021-06-11 16:25:05,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 56 flow [2021-06-11 16:25:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:25:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:25:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2021-06-11 16:25:05,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8191721132897604 [2021-06-11 16:25:05,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2021-06-11 16:25:05,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2021-06-11 16:25:05,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:05,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2021-06-11 16:25:05,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,310 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 376 transitions. [2021-06-11 16:25:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 56 flow [2021-06-11 16:25:05,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:25:05,311 INFO L241 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2021-06-11 16:25:05,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2021-06-11 16:25:05,312 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2021-06-11 16:25:05,312 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:05,312 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2021-06-11 16:25:05,312 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2021-06-11 16:25:05,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2021-06-11 16:25:05,317 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-06-11 16:25:05,317 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:25:05,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2021-06-11 16:25:05,317 INFO L151 LiptonReduction]: Number of co-enabled transitions 118 [2021-06-11 16:25:05,344 INFO L163 LiptonReduction]: Checked pairs total: 102 [2021-06-11 16:25:05,344 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:25:05,344 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 16:25:05,345 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-06-11 16:25:05,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,345 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:05,345 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:05,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 16:25:05,346 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1478955922, now seen corresponding path program 1 times [2021-06-11 16:25:05,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:05,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367819447] [2021-06-11 16:25:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:05,442 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-06-11 16:25:05,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:25:05,450 INFO L142 QuantifierPusher]: treesize reduction 4, result has 66.7 percent of original size [2021-06-11 16:25:05,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 16:25:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:05,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367819447] [2021-06-11 16:25:05,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:05,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:25:05,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958872940] [2021-06-11 16:25:05,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:25:05,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:25:05,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:25:05,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 153 [2021-06-11 16:25:05,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:05,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 153 [2021-06-11 16:25:05,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:05,518 INFO L129 PetriNetUnfolder]: 32/87 cut-off events. [2021-06-11 16:25:05,519 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-11 16:25:05,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 87 events. 32/87 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 301 event pairs, 24 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 167. Up to 53 conditions per place. [2021-06-11 16:25:05,520 INFO L132 encePairwiseOnDemand]: 150/153 looper letters, 8 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-06-11 16:25:05,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 81 flow [2021-06-11 16:25:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:25:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:25:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2021-06-11 16:25:05,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7429193899782135 [2021-06-11 16:25:05,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2021-06-11 16:25:05,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2021-06-11 16:25:05,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:05,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2021-06-11 16:25:05,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,525 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 341 transitions. [2021-06-11 16:25:05,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 81 flow [2021-06-11 16:25:05,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:25:05,527 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 60 flow [2021-06-11 16:25:05,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2021-06-11 16:25:05,527 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2021-06-11 16:25:05,527 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:05,527 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 60 flow [2021-06-11 16:25:05,527 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 60 flow [2021-06-11 16:25:05,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 60 flow [2021-06-11 16:25:05,532 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-06-11 16:25:05,532 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 16:25:05,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-06-11 16:25:05,533 INFO L151 LiptonReduction]: Number of co-enabled transitions 116 [2021-06-11 16:25:05,595 INFO L163 LiptonReduction]: Checked pairs total: 82 [2021-06-11 16:25:05,595 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:25:05,596 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-06-11 16:25:05,597 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 60 flow [2021-06-11 16:25:05,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:05,598 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:05,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 16:25:05,598 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1374009707, now seen corresponding path program 1 times [2021-06-11 16:25:05,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:05,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9130157] [2021-06-11 16:25:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:05,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:05,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:25:05,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:05,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:25:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:05,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9130157] [2021-06-11 16:25:05,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:05,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:25:05,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445261687] [2021-06-11 16:25:05,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:25:05,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:05,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:25:05,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:25:05,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 153 [2021-06-11 16:25:05,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:05,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 153 [2021-06-11 16:25:05,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:05,773 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-06-11 16:25:05,773 INFO L130 PetriNetUnfolder]: For 11/15 co-relation queries the response was YES. [2021-06-11 16:25:05,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 27 events. 0/27 cut-off events. For 11/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 2/28 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-06-11 16:25:05,774 INFO L132 encePairwiseOnDemand]: 150/153 looper letters, 3 selfloop transitions, 3 changer transitions 1/18 dead transitions. [2021-06-11 16:25:05,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 18 transitions, 72 flow [2021-06-11 16:25:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:25:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:25:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-06-11 16:25:05,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8169934640522876 [2021-06-11 16:25:05,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-06-11 16:25:05,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-06-11 16:25:05,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:05,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-06-11 16:25:05,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,779 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 60 flow. Second operand 3 states and 375 transitions. [2021-06-11 16:25:05,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 18 transitions, 72 flow [2021-06-11 16:25:05,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:25:05,780 INFO L241 Difference]: Finished difference. Result has 27 places, 17 transitions, 65 flow [2021-06-11 16:25:05,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2021-06-11 16:25:05,780 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2021-06-11 16:25:05,780 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:05,780 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 17 transitions, 65 flow [2021-06-11 16:25:05,781 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 17 transitions, 65 flow [2021-06-11 16:25:05,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 65 flow [2021-06-11 16:25:05,788 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-06-11 16:25:05,788 INFO L130 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2021-06-11 16:25:05,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 26 events. 0/26 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-06-11 16:25:05,788 INFO L151 LiptonReduction]: Number of co-enabled transitions 96 [2021-06-11 16:25:05,802 INFO L163 LiptonReduction]: Checked pairs total: 76 [2021-06-11 16:25:05,802 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:25:05,802 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-06-11 16:25:05,804 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 65 flow [2021-06-11 16:25:05,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,805 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:05,805 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:05,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 16:25:05,805 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1398018308, now seen corresponding path program 1 times [2021-06-11 16:25:05,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:05,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251344311] [2021-06-11 16:25:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:05,897 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-06-11 16:25:05,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:25:05,906 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-06-11 16:25:05,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:25:05,915 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-06-11 16:25:05,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:25:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:05,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251344311] [2021-06-11 16:25:05,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:05,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:25:05,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626336881] [2021-06-11 16:25:05,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:25:05,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:25:05,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:25:05,922 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2021-06-11 16:25:05,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:05,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:05,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2021-06-11 16:25:05,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:05,992 INFO L129 PetriNetUnfolder]: 29/95 cut-off events. [2021-06-11 16:25:05,992 INFO L130 PetriNetUnfolder]: For 61/69 co-relation queries the response was YES. [2021-06-11 16:25:05,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 95 events. 29/95 cut-off events. For 61/69 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 389 event pairs, 5 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 192. Up to 44 conditions per place. [2021-06-11 16:25:05,995 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 9 selfloop transitions, 4 changer transitions 1/24 dead transitions. [2021-06-11 16:25:05,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 107 flow [2021-06-11 16:25:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:25:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:25:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2021-06-11 16:25:05,998 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7107843137254902 [2021-06-11 16:25:05,998 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2021-06-11 16:25:05,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2021-06-11 16:25:05,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:05,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2021-06-11 16:25:05,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,001 INFO L185 Difference]: Start difference. First operand has 26 places, 17 transitions, 65 flow. Second operand 4 states and 435 transitions. [2021-06-11 16:25:06,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 107 flow [2021-06-11 16:25:06,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 102 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 16:25:06,004 INFO L241 Difference]: Finished difference. Result has 29 places, 19 transitions, 81 flow [2021-06-11 16:25:06,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2021-06-11 16:25:06,005 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2021-06-11 16:25:06,005 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:06,005 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 81 flow [2021-06-11 16:25:06,005 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 81 flow [2021-06-11 16:25:06,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 81 flow [2021-06-11 16:25:06,014 INFO L129 PetriNetUnfolder]: 5/42 cut-off events. [2021-06-11 16:25:06,014 INFO L130 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2021-06-11 16:25:06,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 42 events. 5/42 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 90. Up to 18 conditions per place. [2021-06-11 16:25:06,016 INFO L151 LiptonReduction]: Number of co-enabled transitions 98 [2021-06-11 16:25:06,081 INFO L163 LiptonReduction]: Checked pairs total: 50 [2021-06-11 16:25:06,081 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:25:06,081 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-06-11 16:25:06,082 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 81 flow [2021-06-11 16:25:06,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:06,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:06,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 16:25:06,083 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1407596983, now seen corresponding path program 1 times [2021-06-11 16:25:06,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:06,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595848312] [2021-06-11 16:25:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:06,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:25:06,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:25:06,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:25:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:06,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595848312] [2021-06-11 16:25:06,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:06,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:25:06,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164104435] [2021-06-11 16:25:06,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:25:06,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:25:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:25:06,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2021-06-11 16:25:06,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:06,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2021-06-11 16:25:06,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:06,208 INFO L129 PetriNetUnfolder]: 18/84 cut-off events. [2021-06-11 16:25:06,208 INFO L130 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2021-06-11 16:25:06,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 84 events. 18/84 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 373 event pairs, 7 based on Foata normal form. 11/92 useless extension candidates. Maximal degree in co-relation 191. Up to 40 conditions per place. [2021-06-11 16:25:06,209 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 4 selfloop transitions, 5 changer transitions 3/26 dead transitions. [2021-06-11 16:25:06,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 119 flow [2021-06-11 16:25:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:25:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:25:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2021-06-11 16:25:06,211 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7830065359477124 [2021-06-11 16:25:06,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2021-06-11 16:25:06,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2021-06-11 16:25:06,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:06,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2021-06-11 16:25:06,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 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-06-11 16:25:06,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,216 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 81 flow. Second operand 5 states and 599 transitions. [2021-06-11 16:25:06,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 119 flow [2021-06-11 16:25:06,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:25:06,218 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 113 flow [2021-06-11 16:25:06,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-06-11 16:25:06,219 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2021-06-11 16:25:06,219 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:06,219 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 113 flow [2021-06-11 16:25:06,219 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 113 flow [2021-06-11 16:25:06,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 113 flow [2021-06-11 16:25:06,228 INFO L129 PetriNetUnfolder]: 11/74 cut-off events. [2021-06-11 16:25:06,229 INFO L130 PetriNetUnfolder]: For 58/67 co-relation queries the response was YES. [2021-06-11 16:25:06,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 74 events. 11/74 cut-off events. For 58/67 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 325 event pairs, 6 based on Foata normal form. 2/73 useless extension candidates. Maximal degree in co-relation 193. Up to 27 conditions per place. [2021-06-11 16:25:06,230 INFO L151 LiptonReduction]: Number of co-enabled transitions 108 [2021-06-11 16:25:06,231 INFO L163 LiptonReduction]: Checked pairs total: 16 [2021-06-11 16:25:06,231 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:25:06,232 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-06-11 16:25:06,232 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 113 flow [2021-06-11 16:25:06,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:06,233 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:06,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 16:25:06,233 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash -997540910, now seen corresponding path program 1 times [2021-06-11 16:25:06,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:06,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393993253] [2021-06-11 16:25:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:25:06,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:25:06,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:25:06,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:25:06,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:25:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:25:06,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393993253] [2021-06-11 16:25:06,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:25:06,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:25:06,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652843360] [2021-06-11 16:25:06,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:25:06,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:25:06,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:25:06,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:25:06,329 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2021-06-11 16:25:06,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:25:06,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2021-06-11 16:25:06,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:25:06,378 INFO L129 PetriNetUnfolder]: 7/57 cut-off events. [2021-06-11 16:25:06,378 INFO L130 PetriNetUnfolder]: For 72/112 co-relation queries the response was YES. [2021-06-11 16:25:06,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 57 events. 7/57 cut-off events. For 72/112 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 215 event pairs, 1 based on Foata normal form. 34/90 useless extension candidates. Maximal degree in co-relation 169. Up to 24 conditions per place. [2021-06-11 16:25:06,379 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 2 selfloop transitions, 8 changer transitions 4/26 dead transitions. [2021-06-11 16:25:06,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 26 transitions, 151 flow [2021-06-11 16:25:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:25:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:25:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2021-06-11 16:25:06,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2021-06-11 16:25:06,382 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2021-06-11 16:25:06,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2021-06-11 16:25:06,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:25:06,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2021-06-11 16:25:06,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,388 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,388 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 113 flow. Second operand 7 states and 833 transitions. [2021-06-11 16:25:06,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 26 transitions, 151 flow [2021-06-11 16:25:06,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 26 transitions, 143 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-06-11 16:25:06,392 INFO L241 Difference]: Finished difference. Result has 42 places, 22 transitions, 128 flow [2021-06-11 16:25:06,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=22} [2021-06-11 16:25:06,392 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2021-06-11 16:25:06,392 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:25:06,392 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 22 transitions, 128 flow [2021-06-11 16:25:06,392 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 22 transitions, 128 flow [2021-06-11 16:25:06,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 22 transitions, 128 flow [2021-06-11 16:25:06,396 INFO L129 PetriNetUnfolder]: 2/26 cut-off events. [2021-06-11 16:25:06,397 INFO L130 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2021-06-11 16:25:06,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 26 events. 2/26 cut-off events. For 36/37 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/26 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2021-06-11 16:25:06,399 INFO L151 LiptonReduction]: Number of co-enabled transitions 54 [2021-06-11 16:25:06,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:25:06,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:25:06,545 INFO L163 LiptonReduction]: Checked pairs total: 19 [2021-06-11 16:25:06,546 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 16:25:06,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 154 [2021-06-11 16:25:06,546 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 126 flow [2021-06-11 16:25:06,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:25:06,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:25:06,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:25:06,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 16:25:06,547 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:25:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:25:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1658782863, now seen corresponding path program 1 times [2021-06-11 16:25:06,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:25:06,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986729947] [2021-06-11 16:25:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:25:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:25:06,584 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:25:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:25:06,616 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:25:06,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:25:06,639 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:25:06,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 16:25:06,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:25:06 BasicIcfg [2021-06-11 16:25:06,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:25:06,681 INFO L168 Benchmark]: Toolchain (without parser) took 20938.59 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 305.9 MB in the beginning and 387.4 MB in the end (delta: -81.5 MB). Peak memory consumption was 173.9 MB. Max. memory is 16.0 GB. [2021-06-11 16:25:06,681 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 343.9 MB. Free memory was 324.4 MB in the beginning and 324.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:25:06,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.99 ms. Allocated memory is still 343.9 MB. Free memory was 305.7 MB in the beginning and 302.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.0 GB. [2021-06-11 16:25:06,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.80 ms. Allocated memory is still 343.9 MB. Free memory was 302.7 MB in the beginning and 300.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:25:06,682 INFO L168 Benchmark]: Boogie Preprocessor took 50.44 ms. Allocated memory is still 343.9 MB. Free memory was 300.6 MB in the beginning and 298.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:25:06,682 INFO L168 Benchmark]: RCFGBuilder took 1831.50 ms. Allocated memory is still 343.9 MB. Free memory was 298.5 MB in the beginning and 274.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:25:06,682 INFO L168 Benchmark]: TraceAbstraction took 18413.75 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 274.4 MB in the beginning and 387.4 MB in the end (delta: -113.0 MB). Peak memory consumption was 141.8 MB. Max. memory is 16.0 GB. [2021-06-11 16:25:06,683 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.18 ms. Allocated memory is still 343.9 MB. Free memory was 324.4 MB in the beginning and 324.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 549.99 ms. Allocated memory is still 343.9 MB. Free memory was 305.7 MB in the beginning and 302.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.80 ms. Allocated memory is still 343.9 MB. Free memory was 302.7 MB in the beginning and 300.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.44 ms. Allocated memory is still 343.9 MB. Free memory was 300.6 MB in the beginning and 298.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1831.50 ms. Allocated memory is still 343.9 MB. Free memory was 298.5 MB in the beginning and 274.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18413.75 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 274.4 MB in the beginning and 387.4 MB in the end (delta: -113.0 MB). Peak memory consumption was 141.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: 16204.4ms, 82 PlacesBefore, 27 PlacesAfterwards, 77 TransitionsBefore, 22 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 74 TotalNumberOfCompositions, 2570 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1295, positive: 1183, positive conditional: 1183, positive unconditional: 0, negative: 112, negative conditional: 112, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1295, positive: 1183, positive conditional: 0, positive unconditional: 1183, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1295, positive: 1183, positive conditional: 0, positive unconditional: 1183, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 857, positive: 816, positive conditional: 0, positive unconditional: 816, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 857, positive: 793, positive conditional: 0, positive unconditional: 793, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 765, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 724, negative conditional: 0, negative unconditional: 724, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1295, positive: 367, positive conditional: 0, positive unconditional: 367, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 857, unknown conditional: 0, unknown unconditional: 857] , Statistics on independence cache: Total cache size (in pairs): 857, Positive cache size: 816, Positive conditional cache size: 0, Positive unconditional cache size: 816, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 211.7ms, 25 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 873, Positive cache size: 826, Positive conditional cache size: 0, Positive unconditional cache size: 826, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.9ms, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 878, Positive cache size: 829, Positive conditional cache size: 0, Positive unconditional cache size: 829, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.0ms, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 82 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 6, positive conditional: 3, positive unconditional: 3, negative: 9, negative conditional: 4, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 6, positive conditional: 3, positive unconditional: 3, negative: 9, negative conditional: 4, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 59, negative conditional: 59, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 883, Positive cache size: 830, Positive conditional cache size: 1, Positive unconditional cache size: 829, Negative cache size: 53, Negative conditional cache size: 4, Negative unconditional cache size: 49, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.4ms, 27 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 76 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 884, Positive cache size: 830, Positive conditional cache size: 1, Positive unconditional cache size: 829, Negative cache size: 54, Negative conditional cache size: 4, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.9ms, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 50 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 2, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 2, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 886, Positive cache size: 830, Positive conditional cache size: 1, Positive unconditional cache size: 829, Negative cache size: 56, Negative conditional cache size: 6, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.4ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 886, Positive cache size: 830, Positive conditional cache size: 1, Positive unconditional cache size: 829, Negative cache size: 56, Negative conditional cache size: 6, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 153.1ms, 42 PlacesBefore, 40 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 831, Positive conditional cache size: 1, Positive unconditional cache size: 830, Negative cache size: 57, Negative conditional cache size: 7, Negative unconditional cache size: 50, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2481; [L791] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2482; [L793] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18267.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 419.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16289.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 27 SDtfs, 5 SDslu, 5 SDs, 0 SdLazy, 82 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 117.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=7, InterpolantAutomatonStates: 28, 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: 25.9ms SsaConstructionTime, 287.9ms SatisfiabilityAnalysisTime, 458.2ms InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...