/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:10:11,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:10:11,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:10:11,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:10:11,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:10:11,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:10:11,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:10:11,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:10:11,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:10:11,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:10:11,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:10:11,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:10:11,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:10:11,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:10:11,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:10:11,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:10:11,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:10:11,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:10:11,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:10:11,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:10:11,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:10:11,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:10:11,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:10:11,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:10:11,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:10:11,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:10:11,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:10:11,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:10:11,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:10:11,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:10:11,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:10:11,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:10:11,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:10:11,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:10:11,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:10:11,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:10:11,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:10:11,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:10:11,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:10:11,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:10:11,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:10:11,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:10:11,246 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:10:11,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:10:11,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:10:11,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:10:11,249 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:10:11,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:10:11,250 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:10:11,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:10:11,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:10:11,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:10:11,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:10:11,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:10:11,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:10:11,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:10:11,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:10:11,253 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:10:11,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:10:11,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:10:11,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:10:11,489 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:10:11,489 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:10:11,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2021-03-26 00:10:11,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feacc4d45/9eeca75bdc0341e8912bfadbf9a6323a/FLAGd0deb13c5 [2021-03-26 00:10:11,918 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:10:11,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2021-03-26 00:10:11,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feacc4d45/9eeca75bdc0341e8912bfadbf9a6323a/FLAGd0deb13c5 [2021-03-26 00:10:12,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feacc4d45/9eeca75bdc0341e8912bfadbf9a6323a [2021-03-26 00:10:12,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:10:12,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:10:12,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:10:12,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:10:12,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:10:12,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbfeac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12, skipping insertion in model container [2021-03-26 00:10:12,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:10:12,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:10:12,391 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i[948,961] [2021-03-26 00:10:12,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:10:12,513 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:10:12,540 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i[948,961] [2021-03-26 00:10:12,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:10:12,632 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:10:12,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12 WrapperNode [2021-03-26 00:10:12,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:10:12,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:10:12,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:10:12,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:10:12,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:10:12,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:10:12,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:10:12,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:10:12,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... [2021-03-26 00:10:12,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:10:12,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:10:12,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:10:12,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:10:12,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:10:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:10:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:10:12,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:10:12,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:10:12,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:10:12,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:10:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:10:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:10:12,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:10:12,781 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:10:14,013 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:10:14,013 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:10:14,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:10:14 BoogieIcfgContainer [2021-03-26 00:10:14,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:10:14,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:10:14,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:10:14,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:10:14,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:10:12" (1/3) ... [2021-03-26 00:10:14,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf120d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:10:14, skipping insertion in model container [2021-03-26 00:10:14,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:12" (2/3) ... [2021-03-26 00:10:14,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf120d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:10:14, skipping insertion in model container [2021-03-26 00:10:14,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:10:14" (3/3) ... [2021-03-26 00:10:14,021 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_rmo.opt.i [2021-03-26 00:10:14,025 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:10:14,028 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:10:14,029 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:10:14,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,063 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,063 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,100 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:14,104 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:10:14,116 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:10:14,139 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:10:14,139 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:10:14,139 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:10:14,139 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:10:14,139 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:10:14,139 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:10:14,139 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:10:14,139 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:10:14,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 00:10:14,187 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:10:14,188 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:14,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:10:14,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 00:10:14,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 00:10:14,206 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:14,214 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 00:10:14,215 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 00:10:14,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 00:10:14,228 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:10:14,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:14,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:10:14,231 INFO L142 LiptonReduction]: Number of co-enabled transitions 2630 [2021-03-26 00:10:15,448 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:10:15,816 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 00:10:15,942 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:10:17,123 INFO L154 LiptonReduction]: Checked pairs total: 4854 [2021-03-26 00:10:17,123 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-26 00:10:17,127 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2921 [2021-03-26 00:10:17,138 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:10:17,138 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:17,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:17,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:17,139 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash -885706860, now seen corresponding path program 1 times [2021-03-26 00:10:17,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:17,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174715796] [2021-03-26 00:10:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:17,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:17,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:17,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:17,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:17,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174715796] [2021-03-26 00:10:17,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:17,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:10:17,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717910515] [2021-03-26 00:10:17,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:10:17,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:10:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:10:17,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 195 [2021-03-26 00:10:17,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:17,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:17,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 195 [2021-03-26 00:10:17,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:17,343 INFO L129 PetriNetUnfolder]: 29/152 cut-off events. [2021-03-26 00:10:17,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:17,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 152 events. 29/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 654 event pairs, 15 based on Foata normal form. 11/146 useless extension candidates. Maximal degree in co-relation 199. Up to 41 conditions per place. [2021-03-26 00:10:17,345 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 7 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-26 00:10:17,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 120 flow [2021-03-26 00:10:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:10:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:10:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-03-26 00:10:17,354 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128205128205128 [2021-03-26 00:10:17,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-03-26 00:10:17,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-03-26 00:10:17,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:17,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-03-26 00:10:17,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:17,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:17,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:17,365 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 534 transitions. [2021-03-26 00:10:17,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 120 flow [2021-03-26 00:10:17,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:10:17,368 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 96 flow [2021-03-26 00:10:17,369 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 00:10:17,369 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:10:17,370 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:17,370 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 00:10:17,370 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 00:10:17,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2021-03-26 00:10:17,374 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 00:10:17,374 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:17,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:10:17,374 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-26 00:10:18,562 INFO L154 LiptonReduction]: Checked pairs total: 2472 [2021-03-26 00:10:18,562 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:10:18,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1192 [2021-03-26 00:10:18,564 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-26 00:10:18,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:18,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:18,565 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:18,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:10:18,565 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1723555665, now seen corresponding path program 1 times [2021-03-26 00:10:18,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:18,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206668188] [2021-03-26 00:10:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:18,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:18,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:18,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:18,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:18,663 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:10:18,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:10:18,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:18,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:18,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206668188] [2021-03-26 00:10:18,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:18,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:10:18,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723818482] [2021-03-26 00:10:18,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:10:18,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:10:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:10:18,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 207 [2021-03-26 00:10:18,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:18,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:18,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 207 [2021-03-26 00:10:18,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:18,859 INFO L129 PetriNetUnfolder]: 590/1117 cut-off events. [2021-03-26 00:10:18,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:18,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1117 events. 590/1117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6707 event pairs, 35 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 2027. Up to 340 conditions per place. [2021-03-26 00:10:18,867 INFO L132 encePairwiseOnDemand]: 196/207 looper letters, 14 selfloop transitions, 11 changer transitions 25/68 dead transitions. [2021-03-26 00:10:18,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 248 flow [2021-03-26 00:10:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:10:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:10:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1144 transitions. [2021-03-26 00:10:18,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7895100069013112 [2021-03-26 00:10:18,870 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1144 transitions. [2021-03-26 00:10:18,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1144 transitions. [2021-03-26 00:10:18,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:18,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1144 transitions. [2021-03-26 00:10:18,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.42857142857142) internal successors, (1144), 7 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:18,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:18,876 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:18,876 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 7 states and 1144 transitions. [2021-03-26 00:10:18,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 248 flow [2021-03-26 00:10:18,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:10:18,877 INFO L241 Difference]: Finished difference. Result has 50 places, 39 transitions, 162 flow [2021-03-26 00:10:18,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2021-03-26 00:10:18,878 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 00:10:18,878 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:18,878 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 162 flow [2021-03-26 00:10:18,878 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 162 flow [2021-03-26 00:10:18,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 162 flow [2021-03-26 00:10:18,932 INFO L129 PetriNetUnfolder]: 306/699 cut-off events. [2021-03-26 00:10:18,932 INFO L130 PetriNetUnfolder]: For 259/285 co-relation queries the response was YES. [2021-03-26 00:10:18,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 699 events. 306/699 cut-off events. For 259/285 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4579 event pairs, 83 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 1666. Up to 328 conditions per place. [2021-03-26 00:10:18,937 INFO L142 LiptonReduction]: Number of co-enabled transitions 578 [2021-03-26 00:10:19,430 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:10:19,571 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:10:19,896 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:10:20,038 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:10:20,124 INFO L154 LiptonReduction]: Checked pairs total: 526 [2021-03-26 00:10:20,125 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:10:20,125 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1247 [2021-03-26 00:10:20,126 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 160 flow [2021-03-26 00:10:20,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:20,126 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:20,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:10:20,126 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 481816016, now seen corresponding path program 1 times [2021-03-26 00:10:20,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:20,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785478836] [2021-03-26 00:10:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:20,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:20,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:20,170 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:10:20,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:10:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:20,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785478836] [2021-03-26 00:10:20,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:20,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:10:20,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370976642] [2021-03-26 00:10:20,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:10:20,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:10:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:10:20,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 208 [2021-03-26 00:10:20,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:20,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 208 [2021-03-26 00:10:20,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:20,254 INFO L129 PetriNetUnfolder]: 237/580 cut-off events. [2021-03-26 00:10:20,255 INFO L130 PetriNetUnfolder]: For 332/647 co-relation queries the response was YES. [2021-03-26 00:10:20,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 580 events. 237/580 cut-off events. For 332/647 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3541 event pairs, 71 based on Foata normal form. 23/590 useless extension candidates. Maximal degree in co-relation 1752. Up to 246 conditions per place. [2021-03-26 00:10:20,258 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 21 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2021-03-26 00:10:20,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 278 flow [2021-03-26 00:10:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:10:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:10:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-26 00:10:20,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7956730769230769 [2021-03-26 00:10:20,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-26 00:10:20,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-26 00:10:20,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:20,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-26 00:10:20,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,263 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,263 INFO L185 Difference]: Start difference. First operand has 45 places, 38 transitions, 160 flow. Second operand 4 states and 662 transitions. [2021-03-26 00:10:20,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 278 flow [2021-03-26 00:10:20,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 258 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-26 00:10:20,267 INFO L241 Difference]: Finished difference. Result has 49 places, 43 transitions, 226 flow [2021-03-26 00:10:20,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2021-03-26 00:10:20,267 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2021-03-26 00:10:20,267 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:20,268 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 226 flow [2021-03-26 00:10:20,268 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 226 flow [2021-03-26 00:10:20,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 226 flow [2021-03-26 00:10:20,305 INFO L129 PetriNetUnfolder]: 231/561 cut-off events. [2021-03-26 00:10:20,305 INFO L130 PetriNetUnfolder]: For 631/672 co-relation queries the response was YES. [2021-03-26 00:10:20,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 561 events. 231/561 cut-off events. For 631/672 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3556 event pairs, 55 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 1563. Up to 247 conditions per place. [2021-03-26 00:10:20,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 666 [2021-03-26 00:10:20,352 INFO L154 LiptonReduction]: Checked pairs total: 272 [2021-03-26 00:10:20,353 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:10:20,353 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-03-26 00:10:20,355 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 226 flow [2021-03-26 00:10:20,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,355 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:20,355 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:20,355 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:10:20,355 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:20,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash 226194348, now seen corresponding path program 1 times [2021-03-26 00:10:20,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:20,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130097666] [2021-03-26 00:10:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:20,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:20,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:20,403 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:10:20,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:10:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:20,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130097666] [2021-03-26 00:10:20,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:20,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:10:20,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566709184] [2021-03-26 00:10:20,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:10:20,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:10:20,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:10:20,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 208 [2021-03-26 00:10:20,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:20,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 208 [2021-03-26 00:10:20,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:20,472 INFO L129 PetriNetUnfolder]: 186/473 cut-off events. [2021-03-26 00:10:20,473 INFO L130 PetriNetUnfolder]: For 616/912 co-relation queries the response was YES. [2021-03-26 00:10:20,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 473 events. 186/473 cut-off events. For 616/912 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2717 event pairs, 17 based on Foata normal form. 13/476 useless extension candidates. Maximal degree in co-relation 1585. Up to 189 conditions per place. [2021-03-26 00:10:20,475 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 26 selfloop transitions, 17 changer transitions 0/61 dead transitions. [2021-03-26 00:10:20,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 430 flow [2021-03-26 00:10:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:10:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:10:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-26 00:10:20,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7956730769230769 [2021-03-26 00:10:20,477 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-26 00:10:20,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-26 00:10:20,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:20,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-26 00:10:20,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,480 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,480 INFO L185 Difference]: Start difference. First operand has 49 places, 43 transitions, 226 flow. Second operand 4 states and 662 transitions. [2021-03-26 00:10:20,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 430 flow [2021-03-26 00:10:20,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 416 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:10:20,484 INFO L241 Difference]: Finished difference. Result has 53 places, 54 transitions, 389 flow [2021-03-26 00:10:20,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2021-03-26 00:10:20,485 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:10:20,485 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:20,485 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 54 transitions, 389 flow [2021-03-26 00:10:20,485 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 54 transitions, 389 flow [2021-03-26 00:10:20,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 389 flow [2021-03-26 00:10:20,517 INFO L129 PetriNetUnfolder]: 184/447 cut-off events. [2021-03-26 00:10:20,517 INFO L130 PetriNetUnfolder]: For 880/912 co-relation queries the response was YES. [2021-03-26 00:10:20,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 447 events. 184/447 cut-off events. For 880/912 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2583 event pairs, 29 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 1557. Up to 188 conditions per place. [2021-03-26 00:10:20,521 INFO L142 LiptonReduction]: Number of co-enabled transitions 808 [2021-03-26 00:10:20,556 INFO L154 LiptonReduction]: Checked pairs total: 703 [2021-03-26 00:10:20,556 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:10:20,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-26 00:10:20,557 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 389 flow [2021-03-26 00:10:20,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:20,558 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:20,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:10:20,558 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash 453222404, now seen corresponding path program 1 times [2021-03-26 00:10:20,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:20,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217342821] [2021-03-26 00:10:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:20,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:20,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:20,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:20,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:20,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:20,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:20,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217342821] [2021-03-26 00:10:20,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:20,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:10:20,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361097305] [2021-03-26 00:10:20,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:10:20,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:10:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:10:20,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 208 [2021-03-26 00:10:20,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:20,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 208 [2021-03-26 00:10:20,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:20,835 INFO L129 PetriNetUnfolder]: 1177/2280 cut-off events. [2021-03-26 00:10:20,835 INFO L130 PetriNetUnfolder]: For 1277/1365 co-relation queries the response was YES. [2021-03-26 00:10:20,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5500 conditions, 2280 events. 1177/2280 cut-off events. For 1277/1365 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 18203 event pairs, 480 based on Foata normal form. 163/1974 useless extension candidates. Maximal degree in co-relation 5480. Up to 1517 conditions per place. [2021-03-26 00:10:20,852 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 12 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2021-03-26 00:10:20,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 461 flow [2021-03-26 00:10:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:10:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:10:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 889 transitions. [2021-03-26 00:10:20,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8548076923076923 [2021-03-26 00:10:20,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 889 transitions. [2021-03-26 00:10:20,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 889 transitions. [2021-03-26 00:10:20,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:20,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 889 transitions. [2021-03-26 00:10:20,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:20,857 INFO L185 Difference]: Start difference. First operand has 53 places, 54 transitions, 389 flow. Second operand 5 states and 889 transitions. [2021-03-26 00:10:20,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 461 flow [2021-03-26 00:10:20,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:10:20,862 INFO L241 Difference]: Finished difference. Result has 59 places, 63 transitions, 460 flow [2021-03-26 00:10:20,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2021-03-26 00:10:20,862 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2021-03-26 00:10:20,862 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:20,863 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 460 flow [2021-03-26 00:10:20,863 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 460 flow [2021-03-26 00:10:20,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 460 flow [2021-03-26 00:10:20,977 INFO L129 PetriNetUnfolder]: 887/1804 cut-off events. [2021-03-26 00:10:20,977 INFO L130 PetriNetUnfolder]: For 2281/2817 co-relation queries the response was YES. [2021-03-26 00:10:20,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5758 conditions, 1804 events. 887/1804 cut-off events. For 2281/2817 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 14408 event pairs, 324 based on Foata normal form. 20/1637 useless extension candidates. Maximal degree in co-relation 5736. Up to 1104 conditions per place. [2021-03-26 00:10:20,998 INFO L142 LiptonReduction]: Number of co-enabled transitions 1244 [2021-03-26 00:10:21,453 INFO L154 LiptonReduction]: Checked pairs total: 945 [2021-03-26 00:10:21,453 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:10:21,453 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 591 [2021-03-26 00:10:21,454 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 454 flow [2021-03-26 00:10:21,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:21,454 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:21,454 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:21,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:10:21,455 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1273099415, now seen corresponding path program 1 times [2021-03-26 00:10:21,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:21,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064633255] [2021-03-26 00:10:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:21,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:21,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:21,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:21,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:21,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:21,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:21,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:21,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:21,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064633255] [2021-03-26 00:10:21,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:21,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:10:21,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159907263] [2021-03-26 00:10:21,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:10:21,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:10:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:10:21,498 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 208 [2021-03-26 00:10:21,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:21,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:21,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 208 [2021-03-26 00:10:21,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:21,683 INFO L129 PetriNetUnfolder]: 830/1715 cut-off events. [2021-03-26 00:10:21,683 INFO L130 PetriNetUnfolder]: For 2251/4262 co-relation queries the response was YES. [2021-03-26 00:10:21,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 1715 events. 830/1715 cut-off events. For 2251/4262 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 12795 event pairs, 100 based on Foata normal form. 308/1837 useless extension candidates. Maximal degree in co-relation 6324. Up to 1087 conditions per place. [2021-03-26 00:10:21,695 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 13 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2021-03-26 00:10:21,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 564 flow [2021-03-26 00:10:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:10:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:10:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1067 transitions. [2021-03-26 00:10:21,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8549679487179487 [2021-03-26 00:10:21,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1067 transitions. [2021-03-26 00:10:21,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1067 transitions. [2021-03-26 00:10:21,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:21,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1067 transitions. [2021-03-26 00:10:21,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:21,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:21,701 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:21,701 INFO L185 Difference]: Start difference. First operand has 59 places, 62 transitions, 454 flow. Second operand 6 states and 1067 transitions. [2021-03-26 00:10:21,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 564 flow [2021-03-26 00:10:21,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 557 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:10:21,712 INFO L241 Difference]: Finished difference. Result has 63 places, 67 transitions, 543 flow [2021-03-26 00:10:21,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2021-03-26 00:10:21,713 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2021-03-26 00:10:21,713 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:21,713 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 67 transitions, 543 flow [2021-03-26 00:10:21,713 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 67 transitions, 543 flow [2021-03-26 00:10:21,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 67 transitions, 543 flow [2021-03-26 00:10:21,797 INFO L129 PetriNetUnfolder]: 547/1251 cut-off events. [2021-03-26 00:10:21,798 INFO L130 PetriNetUnfolder]: For 3237/3998 co-relation queries the response was YES. [2021-03-26 00:10:21,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 1251 events. 547/1251 cut-off events. For 3237/3998 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9513 event pairs, 72 based on Foata normal form. 39/1229 useless extension candidates. Maximal degree in co-relation 5403. Up to 798 conditions per place. [2021-03-26 00:10:21,812 INFO L142 LiptonReduction]: Number of co-enabled transitions 1360 [2021-03-26 00:10:22,101 INFO L154 LiptonReduction]: Checked pairs total: 841 [2021-03-26 00:10:22,101 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:10:22,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 388 [2021-03-26 00:10:22,102 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 535 flow [2021-03-26 00:10:22,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:22,103 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:22,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:10:22,103 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash -91943701, now seen corresponding path program 1 times [2021-03-26 00:10:22,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:22,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119617583] [2021-03-26 00:10:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:22,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:22,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:22,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:22,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:22,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:22,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119617583] [2021-03-26 00:10:22,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:22,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:10:22,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180610911] [2021-03-26 00:10:22,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:10:22,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:10:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:10:22,163 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 208 [2021-03-26 00:10:22,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:22,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 208 [2021-03-26 00:10:22,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:22,293 INFO L129 PetriNetUnfolder]: 603/1230 cut-off events. [2021-03-26 00:10:22,294 INFO L130 PetriNetUnfolder]: For 3550/5635 co-relation queries the response was YES. [2021-03-26 00:10:22,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 1230 events. 603/1230 cut-off events. For 3550/5635 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8188 event pairs, 30 based on Foata normal form. 315/1387 useless extension candidates. Maximal degree in co-relation 5585. Up to 734 conditions per place. [2021-03-26 00:10:22,307 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 10 selfloop transitions, 18 changer transitions 4/78 dead transitions. [2021-03-26 00:10:22,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 691 flow [2021-03-26 00:10:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:10:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:10:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1245 transitions. [2021-03-26 00:10:22,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8550824175824175 [2021-03-26 00:10:22,310 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1245 transitions. [2021-03-26 00:10:22,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1245 transitions. [2021-03-26 00:10:22,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:22,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1245 transitions. [2021-03-26 00:10:22,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,315 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,315 INFO L185 Difference]: Start difference. First operand has 63 places, 66 transitions, 535 flow. Second operand 7 states and 1245 transitions. [2021-03-26 00:10:22,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 691 flow [2021-03-26 00:10:22,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 629 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:10:22,329 INFO L241 Difference]: Finished difference. Result has 66 places, 71 transitions, 595 flow [2021-03-26 00:10:22,329 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=66, PETRI_TRANSITIONS=71} [2021-03-26 00:10:22,329 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-26 00:10:22,329 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:22,330 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 71 transitions, 595 flow [2021-03-26 00:10:22,330 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 71 transitions, 595 flow [2021-03-26 00:10:22,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 71 transitions, 595 flow [2021-03-26 00:10:22,374 INFO L129 PetriNetUnfolder]: 318/771 cut-off events. [2021-03-26 00:10:22,374 INFO L130 PetriNetUnfolder]: For 1911/2061 co-relation queries the response was YES. [2021-03-26 00:10:22,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 771 events. 318/771 cut-off events. For 1911/2061 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5189 event pairs, 18 based on Foata normal form. 1/742 useless extension candidates. Maximal degree in co-relation 3272. Up to 377 conditions per place. [2021-03-26 00:10:22,382 INFO L142 LiptonReduction]: Number of co-enabled transitions 1248 [2021-03-26 00:10:22,472 INFO L154 LiptonReduction]: Checked pairs total: 934 [2021-03-26 00:10:22,472 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:10:22,473 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 00:10:22,474 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 585 flow [2021-03-26 00:10:22,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:22,475 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:22,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:10:22,475 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1444839989, now seen corresponding path program 1 times [2021-03-26 00:10:22,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:22,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436397361] [2021-03-26 00:10:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:22,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:22,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:22,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:22,551 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:10:22,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:10:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:22,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436397361] [2021-03-26 00:10:22,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:22,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:10:22,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906078763] [2021-03-26 00:10:22,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:10:22,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:10:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:10:22,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 208 [2021-03-26 00:10:22,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 585 flow. Second operand has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:22,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 208 [2021-03-26 00:10:22,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:22,696 INFO L129 PetriNetUnfolder]: 418/927 cut-off events. [2021-03-26 00:10:22,696 INFO L130 PetriNetUnfolder]: For 2515/2942 co-relation queries the response was YES. [2021-03-26 00:10:22,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 927 events. 418/927 cut-off events. For 2515/2942 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5721 event pairs, 26 based on Foata normal form. 23/916 useless extension candidates. Maximal degree in co-relation 3964. Up to 317 conditions per place. [2021-03-26 00:10:22,704 INFO L132 encePairwiseOnDemand]: 197/208 looper letters, 27 selfloop transitions, 54 changer transitions 0/110 dead transitions. [2021-03-26 00:10:22,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 1080 flow [2021-03-26 00:10:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:10:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:10:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-26 00:10:22,706 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7894230769230769 [2021-03-26 00:10:22,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-26 00:10:22,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-26 00:10:22,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:22,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-26 00:10:22,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,709 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:22,709 INFO L185 Difference]: Start difference. First operand has 66 places, 70 transitions, 585 flow. Second operand 5 states and 821 transitions. [2021-03-26 00:10:22,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 1080 flow [2021-03-26 00:10:22,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 1039 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:10:22,717 INFO L241 Difference]: Finished difference. Result has 68 places, 103 transitions, 1096 flow [2021-03-26 00:10:22,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1096, PETRI_PLACES=68, PETRI_TRANSITIONS=103} [2021-03-26 00:10:22,717 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-26 00:10:22,717 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:22,718 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 103 transitions, 1096 flow [2021-03-26 00:10:22,718 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 103 transitions, 1096 flow [2021-03-26 00:10:22,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 103 transitions, 1096 flow [2021-03-26 00:10:22,786 INFO L129 PetriNetUnfolder]: 409/950 cut-off events. [2021-03-26 00:10:22,787 INFO L130 PetriNetUnfolder]: For 2582/2701 co-relation queries the response was YES. [2021-03-26 00:10:22,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3976 conditions, 950 events. 409/950 cut-off events. For 2582/2701 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6351 event pairs, 22 based on Foata normal form. 17/942 useless extension candidates. Maximal degree in co-relation 3947. Up to 264 conditions per place. [2021-03-26 00:10:22,800 INFO L142 LiptonReduction]: Number of co-enabled transitions 1478 [2021-03-26 00:10:23,130 INFO L154 LiptonReduction]: Checked pairs total: 1391 [2021-03-26 00:10:23,130 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:10:23,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 413 [2021-03-26 00:10:23,131 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 103 transitions, 1096 flow [2021-03-26 00:10:23,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:23,132 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:23,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:10:23,132 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1590819111, now seen corresponding path program 2 times [2021-03-26 00:10:23,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:23,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662348547] [2021-03-26 00:10:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:23,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:23,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:23,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:23,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:23,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:23,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:23,197 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:10:23,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:10:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:23,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662348547] [2021-03-26 00:10:23,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:23,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:10:23,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640493470] [2021-03-26 00:10:23,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:10:23,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:23,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:10:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:10:23,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 208 [2021-03-26 00:10:23,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 103 transitions, 1096 flow. Second operand has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:23,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 208 [2021-03-26 00:10:23,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:23,345 INFO L129 PetriNetUnfolder]: 506/1130 cut-off events. [2021-03-26 00:10:23,345 INFO L130 PetriNetUnfolder]: For 3482/4449 co-relation queries the response was YES. [2021-03-26 00:10:23,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5150 conditions, 1130 events. 506/1130 cut-off events. For 3482/4449 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7503 event pairs, 30 based on Foata normal form. 60/1148 useless extension candidates. Maximal degree in co-relation 5119. Up to 328 conditions per place. [2021-03-26 00:10:23,355 INFO L132 encePairwiseOnDemand]: 197/208 looper letters, 41 selfloop transitions, 54 changer transitions 0/124 dead transitions. [2021-03-26 00:10:23,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 124 transitions, 1530 flow [2021-03-26 00:10:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:10:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:10:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2021-03-26 00:10:23,357 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7876602564102564 [2021-03-26 00:10:23,357 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 983 transitions. [2021-03-26 00:10:23,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 983 transitions. [2021-03-26 00:10:23,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:23,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 983 transitions. [2021-03-26 00:10:23,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,361 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,361 INFO L185 Difference]: Start difference. First operand has 68 places, 103 transitions, 1096 flow. Second operand 6 states and 983 transitions. [2021-03-26 00:10:23,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 124 transitions, 1530 flow [2021-03-26 00:10:23,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 1530 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:10:23,373 INFO L241 Difference]: Finished difference. Result has 76 places, 112 transitions, 1427 flow [2021-03-26 00:10:23,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1427, PETRI_PLACES=76, PETRI_TRANSITIONS=112} [2021-03-26 00:10:23,374 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2021-03-26 00:10:23,374 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:23,374 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 112 transitions, 1427 flow [2021-03-26 00:10:23,374 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 112 transitions, 1427 flow [2021-03-26 00:10:23,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 112 transitions, 1427 flow [2021-03-26 00:10:23,449 INFO L129 PetriNetUnfolder]: 496/1142 cut-off events. [2021-03-26 00:10:23,449 INFO L130 PetriNetUnfolder]: For 3925/4131 co-relation queries the response was YES. [2021-03-26 00:10:23,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5164 conditions, 1142 events. 496/1142 cut-off events. For 3925/4131 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7953 event pairs, 28 based on Foata normal form. 37/1145 useless extension candidates. Maximal degree in co-relation 5130. Up to 353 conditions per place. [2021-03-26 00:10:23,462 INFO L142 LiptonReduction]: Number of co-enabled transitions 1674 [2021-03-26 00:10:23,768 INFO L154 LiptonReduction]: Checked pairs total: 1874 [2021-03-26 00:10:23,768 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:10:23,768 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 394 [2021-03-26 00:10:23,769 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 112 transitions, 1427 flow [2021-03-26 00:10:23,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:23,769 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:23,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:10:23,769 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1665015091, now seen corresponding path program 3 times [2021-03-26 00:10:23,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:23,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481730764] [2021-03-26 00:10:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:23,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:23,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:23,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:23,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:23,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481730764] [2021-03-26 00:10:23,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:23,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:10:23,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622931160] [2021-03-26 00:10:23,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:10:23,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:10:23,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:10:23,820 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 208 [2021-03-26 00:10:23,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 112 transitions, 1427 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:23,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 208 [2021-03-26 00:10:23,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:23,952 INFO L129 PetriNetUnfolder]: 673/1538 cut-off events. [2021-03-26 00:10:23,952 INFO L130 PetriNetUnfolder]: For 5813/6156 co-relation queries the response was YES. [2021-03-26 00:10:23,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 1538 events. 673/1538 cut-off events. For 5813/6156 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11280 event pairs, 48 based on Foata normal form. 23/1497 useless extension candidates. Maximal degree in co-relation 6851. Up to 528 conditions per place. [2021-03-26 00:10:23,965 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 21 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2021-03-26 00:10:23,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 117 transitions, 1584 flow [2021-03-26 00:10:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:10:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:10:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2021-03-26 00:10:23,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8830128205128205 [2021-03-26 00:10:23,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2021-03-26 00:10:23,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2021-03-26 00:10:23,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:23,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2021-03-26 00:10:23,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:23,968 INFO L185 Difference]: Start difference. First operand has 76 places, 112 transitions, 1427 flow. Second operand 3 states and 551 transitions. [2021-03-26 00:10:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 117 transitions, 1584 flow [2021-03-26 00:10:23,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 1532 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:10:23,984 INFO L241 Difference]: Finished difference. Result has 77 places, 112 transitions, 1431 flow [2021-03-26 00:10:23,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=77, PETRI_TRANSITIONS=112} [2021-03-26 00:10:23,985 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2021-03-26 00:10:23,985 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:23,985 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 112 transitions, 1431 flow [2021-03-26 00:10:23,985 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 112 transitions, 1431 flow [2021-03-26 00:10:23,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 112 transitions, 1431 flow [2021-03-26 00:10:24,085 INFO L129 PetriNetUnfolder]: 689/1596 cut-off events. [2021-03-26 00:10:24,085 INFO L130 PetriNetUnfolder]: For 5173/5305 co-relation queries the response was YES. [2021-03-26 00:10:24,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6935 conditions, 1596 events. 689/1596 cut-off events. For 5173/5305 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12102 event pairs, 50 based on Foata normal form. 21/1557 useless extension candidates. Maximal degree in co-relation 6901. Up to 554 conditions per place. [2021-03-26 00:10:24,102 INFO L142 LiptonReduction]: Number of co-enabled transitions 1674 [2021-03-26 00:10:24,399 INFO L154 LiptonReduction]: Checked pairs total: 2014 [2021-03-26 00:10:24,400 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:10:24,400 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 415 [2021-03-26 00:10:24,400 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 112 transitions, 1431 flow [2021-03-26 00:10:24,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:24,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:24,401 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:24,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:10:24,401 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2033377801, now seen corresponding path program 4 times [2021-03-26 00:10:24,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:24,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897012748] [2021-03-26 00:10:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:24,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:24,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:24,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:24,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:24,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:24,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:24,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:24,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:24,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:24,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:24,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:24,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:24,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897012748] [2021-03-26 00:10:24,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:24,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:10:24,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379304821] [2021-03-26 00:10:24,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:10:24,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:24,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:10:24,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:10:24,464 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 208 [2021-03-26 00:10:24,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 112 transitions, 1431 flow. Second operand has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:24,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:24,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 208 [2021-03-26 00:10:24,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:24,718 INFO L129 PetriNetUnfolder]: 1343/2519 cut-off events. [2021-03-26 00:10:24,718 INFO L130 PetriNetUnfolder]: For 7222/9374 co-relation queries the response was YES. [2021-03-26 00:10:24,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10898 conditions, 2519 events. 1343/2519 cut-off events. For 7222/9374 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 18187 event pairs, 26 based on Foata normal form. 392/2582 useless extension candidates. Maximal degree in co-relation 10862. Up to 861 conditions per place. [2021-03-26 00:10:24,744 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 6 selfloop transitions, 18 changer transitions 5/121 dead transitions. [2021-03-26 00:10:24,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1545 flow [2021-03-26 00:10:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:10:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:10:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1415 transitions. [2021-03-26 00:10:24,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8503605769230769 [2021-03-26 00:10:24,747 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1415 transitions. [2021-03-26 00:10:24,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1415 transitions. [2021-03-26 00:10:24,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:24,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1415 transitions. [2021-03-26 00:10:24,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 176.875) internal successors, (1415), 8 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:24,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:24,751 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:24,751 INFO L185 Difference]: Start difference. First operand has 77 places, 112 transitions, 1431 flow. Second operand 8 states and 1415 transitions. [2021-03-26 00:10:24,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1545 flow [2021-03-26 00:10:24,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1491 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 00:10:24,795 INFO L241 Difference]: Finished difference. Result has 84 places, 113 transitions, 1445 flow [2021-03-26 00:10:24,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1445, PETRI_PLACES=84, PETRI_TRANSITIONS=113} [2021-03-26 00:10:24,796 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2021-03-26 00:10:24,796 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:24,796 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 113 transitions, 1445 flow [2021-03-26 00:10:24,796 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 113 transitions, 1445 flow [2021-03-26 00:10:24,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 113 transitions, 1445 flow [2021-03-26 00:10:24,901 INFO L129 PetriNetUnfolder]: 612/1444 cut-off events. [2021-03-26 00:10:24,902 INFO L130 PetriNetUnfolder]: For 5534/5829 co-relation queries the response was YES. [2021-03-26 00:10:24,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 1444 events. 612/1444 cut-off events. For 5534/5829 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11100 event pairs, 26 based on Foata normal form. 15/1394 useless extension candidates. Maximal degree in co-relation 7126. Up to 479 conditions per place. [2021-03-26 00:10:24,918 INFO L142 LiptonReduction]: Number of co-enabled transitions 1598 [2021-03-26 00:10:25,200 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 00:10:25,359 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 00:10:25,982 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:10:26,139 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:10:26,418 INFO L154 LiptonReduction]: Checked pairs total: 4656 [2021-03-26 00:10:26,418 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:10:26,418 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1622 [2021-03-26 00:10:26,419 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 110 transitions, 1429 flow [2021-03-26 00:10:26,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:26,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:26,419 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:26,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:10:26,419 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 895036400, now seen corresponding path program 1 times [2021-03-26 00:10:26,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:26,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144958936] [2021-03-26 00:10:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:26,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:26,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:26,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:26,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:26,463 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:10:26,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:10:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:26,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144958936] [2021-03-26 00:10:26,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:26,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:10:26,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542949241] [2021-03-26 00:10:26,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:10:26,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:10:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:10:26,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 210 [2021-03-26 00:10:26,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 110 transitions, 1429 flow. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:26,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:26,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 210 [2021-03-26 00:10:26,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:26,670 INFO L129 PetriNetUnfolder]: 817/1769 cut-off events. [2021-03-26 00:10:26,670 INFO L130 PetriNetUnfolder]: For 9070/10452 co-relation queries the response was YES. [2021-03-26 00:10:26,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9148 conditions, 1769 events. 817/1769 cut-off events. For 9070/10452 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 13467 event pairs, 24 based on Foata normal form. 88/1764 useless extension candidates. Maximal degree in co-relation 9110. Up to 552 conditions per place. [2021-03-26 00:10:26,678 INFO L132 encePairwiseOnDemand]: 200/210 looper letters, 6 selfloop transitions, 5 changer transitions 113/152 dead transitions. [2021-03-26 00:10:26,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 152 transitions, 2322 flow [2021-03-26 00:10:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:10:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:10:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2021-03-26 00:10:26,686 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7928571428571428 [2021-03-26 00:10:26,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2021-03-26 00:10:26,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2021-03-26 00:10:26,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:26,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2021-03-26 00:10:26,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:26,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:26,690 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:26,690 INFO L185 Difference]: Start difference. First operand has 80 places, 110 transitions, 1429 flow. Second operand 4 states and 666 transitions. [2021-03-26 00:10:26,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 152 transitions, 2322 flow [2021-03-26 00:10:26,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 152 transitions, 2261 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 00:10:26,722 INFO L241 Difference]: Finished difference. Result has 76 places, 39 transitions, 273 flow [2021-03-26 00:10:26,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=76, PETRI_TRANSITIONS=39} [2021-03-26 00:10:26,723 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2021-03-26 00:10:26,723 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:26,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 39 transitions, 273 flow [2021-03-26 00:10:26,723 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 39 transitions, 273 flow [2021-03-26 00:10:26,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 39 transitions, 273 flow [2021-03-26 00:10:26,732 INFO L129 PetriNetUnfolder]: 34/99 cut-off events. [2021-03-26 00:10:26,732 INFO L130 PetriNetUnfolder]: For 470/516 co-relation queries the response was YES. [2021-03-26 00:10:26,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 99 events. 34/99 cut-off events. For 470/516 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 302 event pairs, 6 based on Foata normal form. 18/110 useless extension candidates. Maximal degree in co-relation 343. Up to 28 conditions per place. [2021-03-26 00:10:26,733 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-26 00:10:26,991 INFO L154 LiptonReduction]: Checked pairs total: 295 [2021-03-26 00:10:26,992 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:10:26,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 269 [2021-03-26 00:10:26,992 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 38 transitions, 288 flow [2021-03-26 00:10:26,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:10:26,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:26,992 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:10:26,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:10:26,993 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash 567820139, now seen corresponding path program 1 times [2021-03-26 00:10:26,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:26,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681651056] [2021-03-26 00:10:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:10:27,027 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:10:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:10:27,061 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:10:27,096 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:10:27,096 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:10:27,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:10:27,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:10:27 BasicIcfg [2021-03-26 00:10:27,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:10:27,188 INFO L168 Benchmark]: Toolchain (without parser) took 14915.39 ms. Allocated memory was 255.9 MB in the beginning and 690.0 MB in the end (delta: 434.1 MB). Free memory was 235.5 MB in the beginning and 513.4 MB in the end (delta: -277.9 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:10:27,188 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:10:27,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.33 ms. Allocated memory was 255.9 MB in the beginning and 398.5 MB in the end (delta: 142.6 MB). Free memory was 234.8 MB in the beginning and 361.3 MB in the end (delta: -126.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:10:27,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.74 ms. Allocated memory is still 398.5 MB. Free memory was 361.3 MB in the beginning and 358.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:10:27,189 INFO L168 Benchmark]: Boogie Preprocessor took 19.53 ms. Allocated memory is still 398.5 MB. Free memory was 358.4 MB in the beginning and 356.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:10:27,189 INFO L168 Benchmark]: RCFGBuilder took 1309.57 ms. Allocated memory is still 398.5 MB. Free memory was 356.4 MB in the beginning and 363.5 MB in the end (delta: -7.1 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:10:27,190 INFO L168 Benchmark]: TraceAbstraction took 13170.87 ms. Allocated memory was 398.5 MB in the beginning and 690.0 MB in the end (delta: 291.5 MB). Free memory was 363.5 MB in the beginning and 513.4 MB in the end (delta: -149.9 MB). Peak memory consumption was 141.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:10:27,195 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 361.33 ms. Allocated memory was 255.9 MB in the beginning and 398.5 MB in the end (delta: 142.6 MB). Free memory was 234.8 MB in the beginning and 361.3 MB in the end (delta: -126.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.74 ms. Allocated memory is still 398.5 MB. Free memory was 361.3 MB in the beginning and 358.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.53 ms. Allocated memory is still 398.5 MB. Free memory was 358.4 MB in the beginning and 356.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1309.57 ms. Allocated memory is still 398.5 MB. Free memory was 356.4 MB in the beginning and 363.5 MB in the end (delta: -7.1 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13170.87 ms. Allocated memory was 398.5 MB in the beginning and 690.0 MB in the end (delta: 291.5 MB). Free memory was 363.5 MB in the beginning and 513.4 MB in the end (delta: -149.9 MB). Peak memory consumption was 141.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2907.7ms, 124 PlacesBefore, 57 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 5 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4854 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2143, positive: 2034, positive conditional: 2034, positive unconditional: 0, negative: 109, negative conditional: 109, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1670, positive: 1622, positive conditional: 0, positive unconditional: 1622, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1670, positive: 1622, positive conditional: 0, positive unconditional: 1622, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1670, positive: 1604, positive conditional: 0, positive unconditional: 1604, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 444, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 395, negative conditional: 0, negative unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2143, positive: 412, positive conditional: 412, positive unconditional: 0, negative: 61, negative conditional: 61, negative unconditional: 0, unknown: 1670, unknown conditional: 1670, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1192.3ms, 53 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 30 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 543, positive: 420, positive conditional: 420, positive unconditional: 0, negative: 123, negative conditional: 123, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, positive: 132, positive conditional: 6, positive unconditional: 126, negative: 24, negative conditional: 1, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 156, positive: 132, positive conditional: 6, positive unconditional: 126, negative: 24, negative conditional: 1, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 156, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 24, negative conditional: 1, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 224, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 199, negative conditional: 11, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 543, positive: 288, positive conditional: 288, positive unconditional: 0, negative: 99, negative conditional: 99, negative unconditional: 0, unknown: 156, unknown conditional: 156, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 149, Positive conditional cache size: 149, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1246.3ms, 50 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 176, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 11, positive unconditional: 31, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 11, positive unconditional: 31, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 191, Positive conditional cache size: 191, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.7ms, 49 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 272 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 11, positive unconditional: 16, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 11, positive unconditional: 16, 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: 28, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 218, Positive conditional cache size: 218, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.9ms, 53 PlacesBefore, 53 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 703 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 22, positive unconditional: 5, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 22, positive unconditional: 5, 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: 28, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 245, Positive conditional cache size: 245, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 590.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 945 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 59, positive conditional: 47, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 63, positive: 59, positive conditional: 47, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 63, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 63, unknown conditional: 63, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 252, Positive conditional cache size: 252, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 388.3ms, 63 PlacesBefore, 63 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 1360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 841 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 39, positive conditional: 38, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 39, positive conditional: 38, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 253, Positive conditional cache size: 253, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 142.8ms, 66 PlacesBefore, 66 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 1248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 934 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 136, positive: 116, positive conditional: 116, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 43, 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: 43, positive: 43, positive conditional: 0, positive unconditional: 43, 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: 136, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 262, Positive conditional cache size: 262, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 412.6ms, 68 PlacesBefore, 68 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 8, positive unconditional: 3, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 8, positive unconditional: 3, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 209, negative conditional: 209, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 273, Positive conditional cache size: 273, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 393.9ms, 76 PlacesBefore, 76 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 446, positive: 418, positive conditional: 418, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 48, positive unconditional: 18, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 48, positive unconditional: 18, 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: 70, positive: 66, positive conditional: 0, positive unconditional: 66, 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: 163, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 163, negative conditional: 163, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 446, positive: 352, positive conditional: 352, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 70, unknown conditional: 70, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 339, Positive conditional cache size: 339, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 414.6ms, 77 PlacesBefore, 77 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2014 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 324, positive: 294, positive conditional: 294, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 19, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 19, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 324, positive: 273, positive conditional: 273, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 360, Positive conditional cache size: 360, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1622.0ms, 84 PlacesBefore, 80 PlacesAfterwards, 113 TransitionsBefore, 110 TransitionsAfterwards, 1598 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 4656 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 904, positive: 832, positive conditional: 832, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 71, positive conditional: 66, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 71, positive: 71, positive conditional: 66, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 71, positive: 71, positive conditional: 0, positive unconditional: 71, 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: 904, positive: 761, positive conditional: 761, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 71, unknown conditional: 71, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 362, Positive conditional cache size: 362, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 268.5ms, 76 PlacesBefore, 72 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 295 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 229, positive: 214, positive conditional: 214, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, positive: 97, positive conditional: 75, positive unconditional: 22, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 101, positive: 97, positive conditional: 75, positive unconditional: 22, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 101, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 101, unknown conditional: 101, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 269, Positive conditional cache size: 269, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t621; [L860] FCALL, FORK 0 pthread_create(&t621, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L861] 0 pthread_t t622; [L862] FCALL, FORK 0 pthread_create(&t622, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L863] 0 pthread_t t623; [L864] FCALL, FORK 0 pthread_create(&t623, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L865] 0 pthread_t t624; [L866] FCALL, FORK 0 pthread_create(&t624, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L778] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L780] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] 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) [L872] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L872] 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) [L872] 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) [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 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 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L876] 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 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12961.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2118.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2993.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 125 SDtfs, 93 SDslu, 88 SDs, 0 SdLazy, 307 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 241.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 155.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1445occurred in iteration=11, InterpolantAutomatonStates: 62, 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: 34.5ms SsaConstructionTime, 299.8ms SatisfiabilityAnalysisTime, 450.4ms InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...