/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:34:01,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:34:01,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:34:01,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:34:01,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:34:01,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:34:01,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:34:01,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:34:01,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:34:01,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:34:01,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:34:01,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:34:01,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:34:01,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:34:01,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:34:01,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:34:02,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:34:02,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:34:02,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:34:02,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:34:02,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:34:02,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:34:02,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:34:02,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:34:02,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:34:02,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:34:02,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:34:02,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:34:02,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:34:02,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:34:02,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:34:02,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:34:02,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:34:02,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:34:02,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:34:02,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:34:02,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:34:02,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:34:02,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:34:02,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:34:02,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:34:02,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:34:02,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:34:02,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:34:02,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:34:02,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:34:02,059 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:34:02,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:34:02,060 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:34:02,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:34:02,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:34:02,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:34:02,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:34:02,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:34:02,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:34:02,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:34:02,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:34:02,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:34:02,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:34:02,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:34:02,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:34:02,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:34:02,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:34:02,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:34:02,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:34:02,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:34:02,063 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 15:34:02,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:34:02,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:34:02,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:34:02,370 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:34:02,370 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:34:02,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.opt.i [2021-06-11 15:34:02,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579fb9a76/9994ad3542b445d7b2913aa4092eb2db/FLAGb904dde11 [2021-06-11 15:34:03,033 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:34:03,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.opt.i [2021-06-11 15:34:03,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579fb9a76/9994ad3542b445d7b2913aa4092eb2db/FLAGb904dde11 [2021-06-11 15:34:03,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/579fb9a76/9994ad3542b445d7b2913aa4092eb2db [2021-06-11 15:34:03,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:34:03,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:34:03,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:34:03,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:34:03,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:34:03,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:34:03" (1/1) ... [2021-06-11 15:34:03,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fce2283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:03, skipping insertion in model container [2021-06-11 15:34:03,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:34:03" (1/1) ... [2021-06-11 15:34:03,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:34:03,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:34:03,689 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/mix010_power.opt.i[950,963] [2021-06-11 15:34:03,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:34:03,936 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:34:03,950 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/mix010_power.opt.i[950,963] [2021-06-11 15:34:04,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:34:04,080 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:34:04,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04 WrapperNode [2021-06-11 15:34:04,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:34:04,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:34:04,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:34:04,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:34:04,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:34:04,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:34:04,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:34:04,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:34:04,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... [2021-06-11 15:34:04,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:34:04,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:34:04,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:34:04,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:34:04,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:34:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:34:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:34:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:34:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:34:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:34:04,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:34:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:34:04,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:34:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:34:04,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:34:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:34:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:34:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:34:04,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:34:04,299 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:34:06,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:34:06,515 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:34:06,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:34:06 BoogieIcfgContainer [2021-06-11 15:34:06,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:34:06,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:34:06,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:34:06,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:34:06,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:34:03" (1/3) ... [2021-06-11 15:34:06,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d98cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:34:06, skipping insertion in model container [2021-06-11 15:34:06,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:34:04" (2/3) ... [2021-06-11 15:34:06,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d98cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:34:06, skipping insertion in model container [2021-06-11 15:34:06,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:34:06" (3/3) ... [2021-06-11 15:34:06,524 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010_power.opt.i [2021-06-11 15:34:06,530 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:34:06,535 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:34:06,536 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:34:06,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,575 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,575 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,576 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,576 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,577 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,577 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,593 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,593 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,595 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,595 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,620 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,620 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,624 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:34:06,626 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:34:06,643 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 15:34:06,661 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:34:06,661 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:34:06,661 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:34:06,662 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:34:06,662 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:34:06,662 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:34:06,662 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:34:06,662 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:34:06,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-06-11 15:34:06,706 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-11 15:34:06,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:06,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 15:34:06,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-06-11 15:34:06,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-06-11 15:34:06,716 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:06,728 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-06-11 15:34:06,731 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-06-11 15:34:06,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-06-11 15:34:06,751 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-11 15:34:06,752 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:06,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 15:34:06,755 INFO L151 LiptonReduction]: Number of co-enabled transitions 1750 [2021-06-11 15:34:06,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:06,993 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:34:06,993 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:07,021 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:07,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:07,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:07,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:07,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:07,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:07,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:07,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:07,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:07,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:07,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:07,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,174 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:34:08,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:08,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:08,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:08,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:08,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:08,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:09,133 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:34:09,563 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 15:34:09,681 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 15:34:09,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:09,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:34:09,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:09,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,705 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:34:09,705 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:09,708 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,710 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 15:34:09,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:09,720 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 15:34:09,721 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 15:34:09,721 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:09,725 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,727 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 15:34:09,728 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 15:34:09,728 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:09,732 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,742 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 15:34:09,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:09,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:10,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:10,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:10,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:10,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:10,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:10,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,561 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:34:10,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:10,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:10,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:11,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:11,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:11,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:11,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:11,670 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-11 15:34:11,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:11,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:11,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:34:11,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:11,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:11,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:11,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:34:11,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:34:11,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:11,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:11,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:34:11,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:34:12,307 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:34:12,449 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:34:12,780 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:34:12,925 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:34:12,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:12,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:12,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:12,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:12,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:34:12,963 INFO L163 LiptonReduction]: Checked pairs total: 5038 [2021-06-11 15:34:12,963 INFO L165 LiptonReduction]: Total number of compositions: 95 [2021-06-11 15:34:12,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6251 [2021-06-11 15:34:12,979 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-06-11 15:34:12,979 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:12,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:12,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:12,980 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:12,984 INFO L82 PathProgramCache]: Analyzing trace with hash 198283253, now seen corresponding path program 1 times [2021-06-11 15:34:12,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:12,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564191451] [2021-06-11 15:34:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:13,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:13,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:34:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:13,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564191451] [2021-06-11 15:34:13,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:13,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:34:13,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676288529] [2021-06-11 15:34:13,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:34:13,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:34:13,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:34:13,230 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 198 [2021-06-11 15:34:13,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:13,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 198 [2021-06-11 15:34:13,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:13,279 INFO L129 PetriNetUnfolder]: 13/61 cut-off events. [2021-06-11 15:34:13,279 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:13,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 61 events. 13/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 5 based on Foata normal form. 16/68 useless extension candidates. Maximal degree in co-relation 91. Up to 25 conditions per place. [2021-06-11 15:34:13,281 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 6 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-06-11 15:34:13,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 75 flow [2021-06-11 15:34:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:34:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:34:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2021-06-11 15:34:13,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8602693602693603 [2021-06-11 15:34:13,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2021-06-11 15:34:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2021-06-11 15:34:13,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:13,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2021-06-11 15:34:13,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,310 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 511 transitions. [2021-06-11 15:34:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 75 flow [2021-06-11 15:34:13,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 72 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:34:13,314 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-06-11 15:34:13,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-06-11 15:34:13,316 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 15:34:13,316 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:13,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 15:34:13,316 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 15:34:13,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2021-06-11 15:34:13,320 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 15:34:13,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:13,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:34:13,321 INFO L151 LiptonReduction]: Number of co-enabled transitions 254 [2021-06-11 15:34:13,364 INFO L163 LiptonReduction]: Checked pairs total: 306 [2021-06-11 15:34:13,364 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:34:13,364 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 48 [2021-06-11 15:34:13,365 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 15:34:13,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:13,366 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:13,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:34:13,366 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1571739396, now seen corresponding path program 1 times [2021-06-11 15:34:13,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:13,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567557999] [2021-06-11 15:34:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:13,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:13,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:13,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567557999] [2021-06-11 15:34:13,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:13,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:34:13,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158804292] [2021-06-11 15:34:13,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:34:13,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:34:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:34:13,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 198 [2021-06-11 15:34:13,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:13,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 198 [2021-06-11 15:34:13,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:13,436 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-06-11 15:34:13,437 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:13,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 25 events. 1/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 33. Up to 5 conditions per place. [2021-06-11 15:34:13,437 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 1 selfloop transitions, 2 changer transitions 3/24 dead transitions. [2021-06-11 15:34:13,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 68 flow [2021-06-11 15:34:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:34:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:34:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2021-06-11 15:34:13,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2021-06-11 15:34:13,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2021-06-11 15:34:13,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2021-06-11 15:34:13,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:13,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2021-06-11 15:34:13,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,444 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 513 transitions. [2021-06-11 15:34:13,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 68 flow [2021-06-11 15:34:13,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:34:13,445 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 56 flow [2021-06-11 15:34:13,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2021-06-11 15:34:13,445 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-06-11 15:34:13,446 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:13,446 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 56 flow [2021-06-11 15:34:13,446 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 56 flow [2021-06-11 15:34:13,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-06-11 15:34:13,450 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 15:34:13,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:34:13,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:34:13,450 INFO L151 LiptonReduction]: Number of co-enabled transitions 202 [2021-06-11 15:34:13,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:13,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:13,592 INFO L163 LiptonReduction]: Checked pairs total: 421 [2021-06-11 15:34:13,592 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:34:13,593 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-06-11 15:34:13,597 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-06-11 15:34:13,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:13,598 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:13,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:34:13,598 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1573388515, now seen corresponding path program 1 times [2021-06-11 15:34:13,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:13,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226008581] [2021-06-11 15:34:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:13,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:13,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:13,691 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:34:13,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:34:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:13,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226008581] [2021-06-11 15:34:13,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:13,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:34:13,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298028880] [2021-06-11 15:34:13,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:34:13,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:34:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:34:13,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 199 [2021-06-11 15:34:13,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:13,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 199 [2021-06-11 15:34:13,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:13,757 INFO L129 PetriNetUnfolder]: 28/79 cut-off events. [2021-06-11 15:34:13,757 INFO L130 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2021-06-11 15:34:13,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 79 events. 28/79 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 258 event pairs, 6 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 154. Up to 47 conditions per place. [2021-06-11 15:34:13,758 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 8 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-06-11 15:34:13,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 83 flow [2021-06-11 15:34:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:34:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:34:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2021-06-11 15:34:13,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8023450586264657 [2021-06-11 15:34:13,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2021-06-11 15:34:13,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2021-06-11 15:34:13,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:13,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2021-06-11 15:34:13,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,767 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 479 transitions. [2021-06-11 15:34:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 83 flow [2021-06-11 15:34:13,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:34:13,768 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2021-06-11 15:34:13,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-06-11 15:34:13,769 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2021-06-11 15:34:13,769 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:13,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2021-06-11 15:34:13,770 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2021-06-11 15:34:13,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2021-06-11 15:34:13,774 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 15:34:13,774 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 15:34:13,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:34:13,775 INFO L151 LiptonReduction]: Number of co-enabled transitions 174 [2021-06-11 15:34:13,783 INFO L163 LiptonReduction]: Checked pairs total: 171 [2021-06-11 15:34:13,783 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:34:13,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 15:34:13,784 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2021-06-11 15:34:13,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,785 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:13,785 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:13,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:34:13,788 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1586010885, now seen corresponding path program 1 times [2021-06-11 15:34:13,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:13,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959091492] [2021-06-11 15:34:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:13,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:13,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:13,916 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:34:13,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:13,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:13,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:13,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959091492] [2021-06-11 15:34:13,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:13,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:34:13,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437827001] [2021-06-11 15:34:13,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:34:13,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:34:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:34:13,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2021-06-11 15:34:13,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:13,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2021-06-11 15:34:13,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:13,969 INFO L129 PetriNetUnfolder]: 28/78 cut-off events. [2021-06-11 15:34:13,970 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-11 15:34:13,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 78 events. 28/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 288 event pairs, 12 based on Foata normal form. 8/81 useless extension candidates. Maximal degree in co-relation 154. Up to 45 conditions per place. [2021-06-11 15:34:13,970 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 5 selfloop transitions, 4 changer transitions 7/30 dead transitions. [2021-06-11 15:34:13,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 110 flow [2021-06-11 15:34:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:34:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:34:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions. [2021-06-11 15:34:13,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.807035175879397 [2021-06-11 15:34:13,973 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 803 transitions. [2021-06-11 15:34:13,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions. [2021-06-11 15:34:13,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:13,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions. [2021-06-11 15:34:13,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,978 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 5 states and 803 transitions. [2021-06-11 15:34:13,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 110 flow [2021-06-11 15:34:13,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:34:13,979 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 90 flow [2021-06-11 15:34:13,979 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-06-11 15:34:13,980 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2021-06-11 15:34:13,980 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:13,980 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 90 flow [2021-06-11 15:34:13,980 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 90 flow [2021-06-11 15:34:13,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 90 flow [2021-06-11 15:34:13,990 INFO L129 PetriNetUnfolder]: 23/63 cut-off events. [2021-06-11 15:34:13,991 INFO L130 PetriNetUnfolder]: For 35/40 co-relation queries the response was YES. [2021-06-11 15:34:13,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 63 events. 23/63 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 203 event pairs, 11 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 158. Up to 38 conditions per place. [2021-06-11 15:34:13,994 INFO L151 LiptonReduction]: Number of co-enabled transitions 196 [2021-06-11 15:34:13,996 INFO L163 LiptonReduction]: Checked pairs total: 162 [2021-06-11 15:34:13,996 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:34:13,996 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-06-11 15:34:13,997 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 90 flow [2021-06-11 15:34:13,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:13,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:13,998 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:13,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:34:13,998 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash -136100745, now seen corresponding path program 1 times [2021-06-11 15:34:13,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:13,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022842588] [2021-06-11 15:34:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:14,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,123 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:34:14,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:14,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:14,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022842588] [2021-06-11 15:34:14,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:14,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:34:14,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666546259] [2021-06-11 15:34:14,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:34:14,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:34:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:34:14,135 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2021-06-11 15:34:14,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:14,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2021-06-11 15:34:14,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:14,185 INFO L129 PetriNetUnfolder]: 16/56 cut-off events. [2021-06-11 15:34:14,185 INFO L130 PetriNetUnfolder]: For 52/91 co-relation queries the response was YES. [2021-06-11 15:34:14,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 56 events. 16/56 cut-off events. For 52/91 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 148 event pairs, 2 based on Foata normal form. 14/68 useless extension candidates. Maximal degree in co-relation 175. Up to 35 conditions per place. [2021-06-11 15:34:14,186 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 5 selfloop transitions, 7 changer transitions 7/33 dead transitions. [2021-06-11 15:34:14,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 186 flow [2021-06-11 15:34:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:34:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:34:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2021-06-11 15:34:14,190 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8065326633165829 [2021-06-11 15:34:14,190 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 963 transitions. [2021-06-11 15:34:14,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 963 transitions. [2021-06-11 15:34:14,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:14,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 963 transitions. [2021-06-11 15:34:14,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,197 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,197 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 90 flow. Second operand 6 states and 963 transitions. [2021-06-11 15:34:14,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 186 flow [2021-06-11 15:34:14,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:34:14,200 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 140 flow [2021-06-11 15:34:14,200 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-06-11 15:34:14,200 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-06-11 15:34:14,201 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:14,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 140 flow [2021-06-11 15:34:14,201 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 140 flow [2021-06-11 15:34:14,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 140 flow [2021-06-11 15:34:14,207 INFO L129 PetriNetUnfolder]: 11/44 cut-off events. [2021-06-11 15:34:14,207 INFO L130 PetriNetUnfolder]: For 72/78 co-relation queries the response was YES. [2021-06-11 15:34:14,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 44 events. 11/44 cut-off events. For 72/78 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 2 based on Foata normal form. 3/46 useless extension candidates. Maximal degree in co-relation 142. Up to 23 conditions per place. [2021-06-11 15:34:14,208 INFO L151 LiptonReduction]: Number of co-enabled transitions 196 [2021-06-11 15:34:14,211 INFO L163 LiptonReduction]: Checked pairs total: 205 [2021-06-11 15:34:14,211 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:34:14,211 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 15:34:14,213 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 140 flow [2021-06-11 15:34:14,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:14,214 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:14,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:34:14,214 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1947550455, now seen corresponding path program 1 times [2021-06-11 15:34:14,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:14,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667702415] [2021-06-11 15:34:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:14,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:14,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,304 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:34:14,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:34:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:14,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667702415] [2021-06-11 15:34:14,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:14,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:34:14,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223218593] [2021-06-11 15:34:14,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:34:14,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:14,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:34:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:34:14,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2021-06-11 15:34:14,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:14,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2021-06-11 15:34:14,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:14,380 INFO L129 PetriNetUnfolder]: 46/145 cut-off events. [2021-06-11 15:34:14,380 INFO L130 PetriNetUnfolder]: For 240/250 co-relation queries the response was YES. [2021-06-11 15:34:14,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 145 events. 46/145 cut-off events. For 240/250 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 629 event pairs, 7 based on Foata normal form. 15/157 useless extension candidates. Maximal degree in co-relation 487. Up to 72 conditions per place. [2021-06-11 15:34:14,382 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 10 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-06-11 15:34:14,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 194 flow [2021-06-11 15:34:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:34:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:34:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2021-06-11 15:34:14,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7608040201005025 [2021-06-11 15:34:14,385 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 757 transitions. [2021-06-11 15:34:14,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 757 transitions. [2021-06-11 15:34:14,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:14,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 757 transitions. [2021-06-11 15:34:14,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,389 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,389 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 140 flow. Second operand 5 states and 757 transitions. [2021-06-11 15:34:14,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 194 flow [2021-06-11 15:34:14,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 164 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-06-11 15:34:14,392 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 143 flow [2021-06-11 15:34:14,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-06-11 15:34:14,392 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-06-11 15:34:14,392 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:14,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 143 flow [2021-06-11 15:34:14,393 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 143 flow [2021-06-11 15:34:14,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 143 flow [2021-06-11 15:34:14,404 INFO L129 PetriNetUnfolder]: 26/95 cut-off events. [2021-06-11 15:34:14,404 INFO L130 PetriNetUnfolder]: For 90/96 co-relation queries the response was YES. [2021-06-11 15:34:14,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 95 events. 26/95 cut-off events. For 90/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 346 event pairs, 4 based on Foata normal form. 5/97 useless extension candidates. Maximal degree in co-relation 255. Up to 46 conditions per place. [2021-06-11 15:34:14,405 INFO L151 LiptonReduction]: Number of co-enabled transitions 214 [2021-06-11 15:34:14,494 INFO L163 LiptonReduction]: Checked pairs total: 186 [2021-06-11 15:34:14,494 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:34:14,494 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 102 [2021-06-11 15:34:14,495 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 143 flow [2021-06-11 15:34:14,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:14,495 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:14,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:34:14,495 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -365859871, now seen corresponding path program 2 times [2021-06-11 15:34:14,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:14,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357190440] [2021-06-11 15:34:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:14,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:14,617 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:34:14,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:34:14,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:14,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:14,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357190440] [2021-06-11 15:34:14,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:14,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:34:14,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956964898] [2021-06-11 15:34:14,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:34:14,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:34:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:34:14,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2021-06-11 15:34:14,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:14,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2021-06-11 15:34:14,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:14,687 INFO L129 PetriNetUnfolder]: 16/67 cut-off events. [2021-06-11 15:34:14,687 INFO L130 PetriNetUnfolder]: For 85/131 co-relation queries the response was YES. [2021-06-11 15:34:14,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 67 events. 16/67 cut-off events. For 85/131 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 26/90 useless extension candidates. Maximal degree in co-relation 211. Up to 33 conditions per place. [2021-06-11 15:34:14,688 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 2 selfloop transitions, 10 changer transitions 6/34 dead transitions. [2021-06-11 15:34:14,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 205 flow [2021-06-11 15:34:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:34:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:34:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2021-06-11 15:34:14,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8018664752333095 [2021-06-11 15:34:14,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2021-06-11 15:34:14,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2021-06-11 15:34:14,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:14,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2021-06-11 15:34:14,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.57142857142858) internal successors, (1117), 7 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,698 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:14,698 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 143 flow. Second operand 7 states and 1117 transitions. [2021-06-11 15:34:14,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 205 flow [2021-06-11 15:34:14,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 183 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-06-11 15:34:14,700 INFO L241 Difference]: Finished difference. Result has 47 places, 28 transitions, 149 flow [2021-06-11 15:34:14,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2021-06-11 15:34:14,701 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2021-06-11 15:34:14,701 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:14,701 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 28 transitions, 149 flow [2021-06-11 15:34:14,701 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 28 transitions, 149 flow [2021-06-11 15:34:14,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 149 flow [2021-06-11 15:34:14,710 INFO L129 PetriNetUnfolder]: 8/42 cut-off events. [2021-06-11 15:34:14,710 INFO L130 PetriNetUnfolder]: For 44/47 co-relation queries the response was YES. [2021-06-11 15:34:14,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 42 events. 8/42 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 115. Up to 15 conditions per place. [2021-06-11 15:34:14,711 INFO L151 LiptonReduction]: Number of co-enabled transitions 136 [2021-06-11 15:34:15,500 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 181 [2021-06-11 15:34:15,797 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2021-06-11 15:34:17,163 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 306 DAG size of output: 262 [2021-06-11 15:34:17,777 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-06-11 15:34:17,804 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 15:34:17,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,819 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:34:17,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:34:17,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:34:17,832 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:34:17,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,839 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:34:17,839 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:34:17,840 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,841 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,842 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:34:17,842 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,843 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,844 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:34:17,844 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,845 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,857 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 15:34:17,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,861 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 15:34:17,862 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 15:34:17,862 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,863 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,864 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 15:34:17,864 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,865 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,865 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:34:17,866 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,866 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,870 INFO L147 QuantifierPusher]: treesize reduction 378, result has 29.3 percent of original size 157 [2021-06-11 15:34:17,870 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:34:17,871 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,872 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,873 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:34:17,873 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,874 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,874 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:34:17,874 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:17,875 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:34:17,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:17,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:17,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:17,890 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:34:17,900 INFO L147 QuantifierPusher]: treesize reduction 1487, result has 18.8 percent of original size 344 [2021-06-11 15:34:18,083 INFO L163 LiptonReduction]: Checked pairs total: 236 [2021-06-11 15:34:18,083 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:34:18,083 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3382 [2021-06-11 15:34:18,084 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 147 flow [2021-06-11 15:34:18,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:18,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:18,085 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-06-11 15:34:18,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:34:18,085 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2030944711, now seen corresponding path program 1 times [2021-06-11 15:34:18,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:18,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697223236] [2021-06-11 15:34:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:18,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:18,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:18,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:18,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:18,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:18,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:34:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:18,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697223236] [2021-06-11 15:34:18,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:18,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:34:18,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391848175] [2021-06-11 15:34:18,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:34:18,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:34:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:34:18,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-06-11 15:34:18,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:18,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:18,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-06-11 15:34:18,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:18,215 INFO L129 PetriNetUnfolder]: 13/58 cut-off events. [2021-06-11 15:34:18,216 INFO L130 PetriNetUnfolder]: For 76/84 co-relation queries the response was YES. [2021-06-11 15:34:18,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 58 events. 13/58 cut-off events. For 76/84 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 149 event pairs, 0 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 174. Up to 25 conditions per place. [2021-06-11 15:34:18,216 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 1 changer transitions 3/28 dead transitions. [2021-06-11 15:34:18,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 28 transitions, 159 flow [2021-06-11 15:34:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:34:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:34:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2021-06-11 15:34:18,218 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8225 [2021-06-11 15:34:18,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2021-06-11 15:34:18,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2021-06-11 15:34:18,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:18,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2021-06-11 15:34:18,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:18,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:18,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:18,224 INFO L185 Difference]: Start difference. First operand has 43 places, 27 transitions, 147 flow. Second operand 4 states and 658 transitions. [2021-06-11 15:34:18,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 28 transitions, 159 flow [2021-06-11 15:34:18,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 125 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-06-11 15:34:18,225 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 111 flow [2021-06-11 15:34:18,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2021-06-11 15:34:18,226 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2021-06-11 15:34:18,226 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:18,226 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 111 flow [2021-06-11 15:34:18,226 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 111 flow [2021-06-11 15:34:18,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 111 flow [2021-06-11 15:34:18,233 INFO L129 PetriNetUnfolder]: 7/39 cut-off events. [2021-06-11 15:34:18,233 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-11 15:34:18,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 39 events. 7/39 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 94. Up to 12 conditions per place. [2021-06-11 15:34:18,233 INFO L151 LiptonReduction]: Number of co-enabled transitions 50 [2021-06-11 15:34:18,666 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 161 [2021-06-11 15:34:18,821 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-11 15:34:19,864 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 330 DAG size of output: 226 [2021-06-11 15:34:20,124 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-06-11 15:34:20,142 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 15:34:20,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:34:20,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:20,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,154 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:34:20,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:34:20,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:34:20,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,170 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:34:20,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:34:20,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,176 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:34:20,176 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:34:20,176 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,178 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,178 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:34:20,178 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,179 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,180 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:34:20,180 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,181 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,185 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 15:34:20,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:34:20,187 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 15:34:20,188 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 15:34:20,188 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,190 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,190 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 15:34:20,191 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,191 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,192 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:34:20,192 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,193 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,201 INFO L147 QuantifierPusher]: treesize reduction 341, result has 36.3 percent of original size 194 [2021-06-11 15:34:20,202 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:34:20,202 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,203 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,204 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:34:20,204 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,205 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,205 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:34:20,206 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:34:20,206 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,214 INFO L147 QuantifierPusher]: treesize reduction 1551, result has 15.3 percent of original size 280 [2021-06-11 15:34:20,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:20,347 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 15:34:20,584 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-11 15:34:20,731 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-11 15:34:20,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:34:20,752 INFO L163 LiptonReduction]: Checked pairs total: 94 [2021-06-11 15:34:20,752 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 15:34:20,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2526 [2021-06-11 15:34:20,753 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 105 flow [2021-06-11 15:34:20,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:20,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:20,753 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:20,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:34:20,753 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 411518612, now seen corresponding path program 1 times [2021-06-11 15:34:20,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:20,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142001991] [2021-06-11 15:34:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:34:20,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:34:20,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:34:20,862 INFO L142 QuantifierPusher]: treesize reduction 131, result has 63.5 percent of original size [2021-06-11 15:34:20,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 228 [2021-06-11 15:34:20,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:20,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:34:21,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:21,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:34:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:34:21,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142001991] [2021-06-11 15:34:21,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:34:21,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:34:21,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969848910] [2021-06-11 15:34:21,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:34:21,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:34:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:34:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:34:21,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 203 [2021-06-11 15:34:21,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:21,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:34:21,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 203 [2021-06-11 15:34:21,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:34:21,160 INFO L129 PetriNetUnfolder]: 13/55 cut-off events. [2021-06-11 15:34:21,160 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-11 15:34:21,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 55 events. 13/55 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 170 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 152. Up to 21 conditions per place. [2021-06-11 15:34:21,161 INFO L132 encePairwiseOnDemand]: 198/203 looper letters, 1 selfloop transitions, 4 changer transitions 1/23 dead transitions. [2021-06-11 15:34:21,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 23 transitions, 121 flow [2021-06-11 15:34:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:34:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:34:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2021-06-11 15:34:21,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6707717569786535 [2021-06-11 15:34:21,164 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2021-06-11 15:34:21,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2021-06-11 15:34:21,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:34:21,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2021-06-11 15:34:21,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:21,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:21,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:21,169 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 105 flow. Second operand 6 states and 817 transitions. [2021-06-11 15:34:21,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 23 transitions, 121 flow [2021-06-11 15:34:21,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 23 transitions, 114 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-06-11 15:34:21,171 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 110 flow [2021-06-11 15:34:21,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2021-06-11 15:34:21,171 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2021-06-11 15:34:21,171 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:34:21,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 22 transitions, 110 flow [2021-06-11 15:34:21,171 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 110 flow [2021-06-11 15:34:21,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 22 transitions, 110 flow [2021-06-11 15:34:21,181 INFO L129 PetriNetUnfolder]: 8/41 cut-off events. [2021-06-11 15:34:21,181 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-11 15:34:21,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 41 events. 8/41 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 103 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 107. Up to 14 conditions per place. [2021-06-11 15:34:21,181 INFO L151 LiptonReduction]: Number of co-enabled transitions 18 [2021-06-11 15:34:21,361 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-11 15:34:21,806 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-06-11 15:34:21,943 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-11 15:34:21,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:34:21,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:34:22,120 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-11 15:34:22,529 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-06-11 15:34:22,650 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-11 15:34:22,814 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-11 15:34:23,219 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-06-11 15:34:23,363 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-11 15:34:23,366 INFO L163 LiptonReduction]: Checked pairs total: 15 [2021-06-11 15:34:23,366 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 15:34:23,366 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2195 [2021-06-11 15:34:23,367 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 114 flow [2021-06-11 15:34:23,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:34:23,367 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:34:23,367 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:34:23,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 15:34:23,367 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:34:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:34:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1326521937, now seen corresponding path program 1 times [2021-06-11 15:34:23,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:34:23,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668995035] [2021-06-11 15:34:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:34:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:34:23,398 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:34:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:34:23,436 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:34:23,471 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:34:23,471 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:34:23,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 15:34:23,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:34:23 BasicIcfg [2021-06-11 15:34:23,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:34:23,571 INFO L168 Benchmark]: Toolchain (without parser) took 20140.55 ms. Allocated memory was 331.4 MB in the beginning and 612.4 MB in the end (delta: 281.0 MB). Free memory was 293.9 MB in the beginning and 518.5 MB in the end (delta: -224.6 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:34:23,571 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 331.4 MB. Free memory was 312.2 MB in the beginning and 312.1 MB in the end (delta: 65.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:34:23,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.92 ms. Allocated memory is still 331.4 MB. Free memory was 293.7 MB in the beginning and 289.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:34:23,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.16 ms. Allocated memory is still 331.4 MB. Free memory was 289.0 MB in the beginning and 285.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:34:23,572 INFO L168 Benchmark]: Boogie Preprocessor took 56.62 ms. Allocated memory is still 331.4 MB. Free memory was 285.8 MB in the beginning and 283.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:34:23,572 INFO L168 Benchmark]: RCFGBuilder took 2297.22 ms. Allocated memory was 331.4 MB in the beginning and 404.8 MB in the end (delta: 73.4 MB). Free memory was 283.7 MB in the beginning and 378.8 MB in the end (delta: -95.1 MB). Peak memory consumption was 143.5 MB. Max. memory is 16.0 GB. [2021-06-11 15:34:23,572 INFO L168 Benchmark]: TraceAbstraction took 17051.80 ms. Allocated memory was 404.8 MB in the beginning and 612.4 MB in the end (delta: 207.6 MB). Free memory was 378.8 MB in the beginning and 518.5 MB in the end (delta: -139.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:34:23,573 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.19 ms. Allocated memory is still 331.4 MB. Free memory was 312.2 MB in the beginning and 312.1 MB in the end (delta: 65.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 646.92 ms. Allocated memory is still 331.4 MB. Free memory was 293.7 MB in the beginning and 289.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 79.16 ms. Allocated memory is still 331.4 MB. Free memory was 289.0 MB in the beginning and 285.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.62 ms. Allocated memory is still 331.4 MB. Free memory was 285.8 MB in the beginning and 283.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2297.22 ms. Allocated memory was 331.4 MB in the beginning and 404.8 MB in the end (delta: 73.4 MB). Free memory was 283.7 MB in the beginning and 378.8 MB in the end (delta: -95.1 MB). Peak memory consumption was 143.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17051.80 ms. Allocated memory was 404.8 MB in the beginning and 612.4 MB in the end (delta: 207.6 MB). Free memory was 378.8 MB in the beginning and 518.5 MB in the end (delta: -139.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6232.2ms, 108 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1750 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 5038 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2234, positive: 2067, positive conditional: 2067, positive unconditional: 0, negative: 167, negative conditional: 167, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2234, positive: 2067, positive conditional: 0, positive unconditional: 2067, negative: 167, negative conditional: 0, negative unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2234, positive: 2067, positive conditional: 0, positive unconditional: 2067, negative: 167, negative conditional: 0, negative unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1416, positive: 1364, positive conditional: 0, positive unconditional: 1364, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1416, positive: 1354, positive conditional: 0, positive unconditional: 1354, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 700, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 673, negative conditional: 0, negative unconditional: 673, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2234, positive: 703, positive conditional: 0, positive unconditional: 703, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 1416, unknown conditional: 0, unknown unconditional: 1416] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1364, Positive conditional cache size: 0, Positive unconditional cache size: 1364, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.8ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, positive: 105, positive conditional: 105, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, positive: 105, positive conditional: 3, positive unconditional: 102, negative: 22, negative conditional: 3, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 105, positive conditional: 3, positive unconditional: 102, negative: 22, negative conditional: 3, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 2, positive unconditional: 14, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 30, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, positive: 89, positive conditional: 1, positive unconditional: 88, negative: 18, negative conditional: 1, negative unconditional: 17, unknown: 20, unknown conditional: 4, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 1436, Positive cache size: 1380, Positive conditional cache size: 2, Positive unconditional cache size: 1378, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.5ms, 33 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 421 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 1467, Positive cache size: 1405, Positive conditional cache size: 2, Positive unconditional cache size: 1403, Negative cache size: 62, Negative conditional cache size: 2, Negative unconditional cache size: 60, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.0ms, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1474, Positive cache size: 1410, Positive conditional cache size: 2, Positive unconditional cache size: 1408, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.4ms, 36 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, positive: 78, positive conditional: 19, positive unconditional: 59, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 78, positive conditional: 19, positive unconditional: 59, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 4, positive unconditional: 4, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 90, positive: 70, positive conditional: 15, positive unconditional: 55, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1418, Positive conditional cache size: 6, Positive unconditional cache size: 1412, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5ms, 40 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 205 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, positive: 79, positive conditional: 29, positive unconditional: 50, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 79, positive conditional: 29, positive unconditional: 50, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 94, positive: 77, positive conditional: 29, positive unconditional: 48, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1484, Positive cache size: 1420, Positive conditional cache size: 6, Positive unconditional cache size: 1414, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 186 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, positive: 100, positive conditional: 41, positive unconditional: 59, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 100, positive conditional: 41, positive unconditional: 59, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 97, positive conditional: 38, positive unconditional: 59, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1488, Positive cache size: 1423, Positive conditional cache size: 9, Positive unconditional cache size: 1414, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3381.9ms, 47 PlacesBefore, 43 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, positive: 125, positive conditional: 125, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, positive: 125, positive conditional: 50, positive unconditional: 75, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 125, positive conditional: 50, positive unconditional: 75, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 15, positive conditional: 4, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 293, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 293, negative conditional: 0, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, positive: 110, positive conditional: 46, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 22, unknown conditional: 4, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 1510, Positive cache size: 1438, Positive conditional cache size: 13, Positive unconditional cache size: 1425, Negative cache size: 72, Negative conditional cache size: 2, Negative unconditional cache size: 70, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2526.0ms, 41 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 94 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, positive: 61, positive conditional: 43, positive unconditional: 18, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 61, positive conditional: 43, positive unconditional: 18, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, positive: 56, positive conditional: 39, positive unconditional: 17, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1515, Positive cache size: 1443, Positive conditional cache size: 17, Positive unconditional cache size: 1426, Negative cache size: 72, Negative conditional cache size: 2, Negative unconditional cache size: 70, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2194.7ms, 39 PlacesBefore, 37 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1516, Positive cache size: 1444, Positive conditional cache size: 18, Positive unconditional cache size: 1426, Negative cache size: 72, Negative conditional cache size: 2, Negative unconditional cache size: 70, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L864] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16814.5ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 628.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6314.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 43 SDtfs, 23 SDslu, 26 SDs, 0 SdLazy, 150 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 167.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 348.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=7, InterpolantAutomatonStates: 42, 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: 36.2ms SsaConstructionTime, 417.3ms SatisfiabilityAnalysisTime, 731.9ms InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...