/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:24:18,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:24:18,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:24:18,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:24:18,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:24:18,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:24:18,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:24:18,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:24:18,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:24:18,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:24:18,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:24:18,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:24:18,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:24:18,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:24:18,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:24:18,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:24:18,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:24:18,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:24:18,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:24:18,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:24:18,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:24:18,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:24:18,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:24:18,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:24:18,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:24:18,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:24:18,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:24:18,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:24:18,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:24:18,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:24:18,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:24:18,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:24:18,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:24:18,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:24:18,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:24:18,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:24:18,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:24:18,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:24:18,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:24:18,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:24:18,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:24:18,332 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-RepeatedSemanticLbe.epf [2021-03-25 14:24:18,368 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:24:18,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:24:18,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:24:18,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:24:18,372 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:24:18,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:24:18,372 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:24:18,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:24:18,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:24:18,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:24:18,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:24:18,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:24:18,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:24:18,374 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:24:18,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:24:18,374 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:24:18,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:24:18,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:24:18,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:24:18,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:24:18,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:24:18,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:24:18,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:24:18,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:24:18,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:24:18,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:24:18,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:24:18,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:24:18,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:24:18,376 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:24:18,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:24:18,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:24:18,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:24:18,719 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:24:18,720 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:24:18,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i [2021-03-25 14:24:18,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e069e76b/90e601e84b524b7287ec48b3c4a480f2/FLAG8bda40be5 [2021-03-25 14:24:19,302 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:24:19,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i [2021-03-25 14:24:19,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e069e76b/90e601e84b524b7287ec48b3c4a480f2/FLAG8bda40be5 [2021-03-25 14:24:19,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e069e76b/90e601e84b524b7287ec48b3c4a480f2 [2021-03-25 14:24:19,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:24:19,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:24:19,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:24:19,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:24:19,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:24:19,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:24:19" (1/1) ... [2021-03-25 14:24:19,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ff16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:19, skipping insertion in model container [2021-03-25 14:24:19,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:24:19" (1/1) ... [2021-03-25 14:24:19,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:24:19,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:24:19,747 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i[948,961] [2021-03-25 14:24:20,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:24:20,073 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:24:20,082 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i[948,961] [2021-03-25 14:24:20,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:24:20,227 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:24:20,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20 WrapperNode [2021-03-25 14:24:20,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:24:20,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:24:20,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:24:20,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:24:20,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:24:20,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:24:20,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:24:20,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:24:20,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... [2021-03-25 14:24:20,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:24:20,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:24:20,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:24:20,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:24:20,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:24:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:24:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:24:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:24:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:24:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:24:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:24:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:24:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:24:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:24:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:24:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:24:20,452 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:24:24,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:24:24,522 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-03-25 14:24:24,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:24:24 BoogieIcfgContainer [2021-03-25 14:24:24,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:24:24,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:24:24,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:24:24,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:24:24,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:24:19" (1/3) ... [2021-03-25 14:24:24,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668508ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:24:24, skipping insertion in model container [2021-03-25 14:24:24,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:24:20" (2/3) ... [2021-03-25 14:24:24,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668508ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:24:24, skipping insertion in model container [2021-03-25 14:24:24,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:24:24" (3/3) ... [2021-03-25 14:24:24,530 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_tso.opt.i [2021-03-25 14:24:24,535 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:24:24,539 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-03-25 14:24:24,539 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:24:24,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,661 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,667 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:24:24,673 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:24:24,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-03-25 14:24:24,718 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:24:24,718 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:24:24,718 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:24:24,719 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:24:24,719 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:24:24,719 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:24:24,719 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:24:24,719 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:24:24,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2021-03-25 14:24:24,795 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2021-03-25 14:24:24,796 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:24,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-03-25 14:24:24,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2021-03-25 14:24:24,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2021-03-25 14:24:24,818 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:24,832 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2021-03-25 14:24:24,834 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2021-03-25 14:24:24,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2021-03-25 14:24:24,857 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2021-03-25 14:24:24,857 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:24,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-03-25 14:24:24,861 INFO L142 LiptonReduction]: Number of co-enabled transitions 2988 [2021-03-25 14:24:28,308 WARN L205 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 432 DAG size of output: 352 [2021-03-25 14:24:29,079 WARN L205 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 348 [2021-03-25 14:24:32,937 WARN L205 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 600 DAG size of output: 511 [2021-03-25 14:24:34,691 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 506 [2021-03-25 14:24:35,594 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2021-03-25 14:24:35,754 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:24:36,763 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 208 DAG size of output: 158 [2021-03-25 14:24:37,168 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2021-03-25 14:24:39,871 WARN L205 SmtUtils]: Spent 917.00 ms on a formula simplification that was a NOOP. DAG size: 350 [2021-03-25 14:24:40,722 WARN L205 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 350 [2021-03-25 14:24:44,434 WARN L205 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 508 DAG size of output: 507 [2021-03-25 14:24:46,515 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 507 [2021-03-25 14:24:46,872 INFO L154 LiptonReduction]: Checked pairs total: 6284 [2021-03-25 14:24:46,872 INFO L156 LiptonReduction]: Total number of compositions: 86 [2021-03-25 14:24:46,874 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22062 [2021-03-25 14:24:46,882 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 14:24:46,882 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:46,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:46,883 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:46,884 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1018126350, now seen corresponding path program 1 times [2021-03-25 14:24:46,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:46,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487690137] [2021-03-25 14:24:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:47,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:47,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:24:47,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:47,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:47,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487690137] [2021-03-25 14:24:47,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:47,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:24:47,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95862972] [2021-03-25 14:24:47,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:24:47,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:24:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:24:47,170 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 224 [2021-03-25 14:24:47,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:47,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:47,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 224 [2021-03-25 14:24:47,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:47,482 INFO L129 PetriNetUnfolder]: 257/622 cut-off events. [2021-03-25 14:24:47,482 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:47,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 622 events. 257/622 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3848 event pairs, 179 based on Foata normal form. 27/594 useless extension candidates. Maximal degree in co-relation 992. Up to 313 conditions per place. [2021-03-25 14:24:47,494 INFO L132 encePairwiseOnDemand]: 220/224 looper letters, 14 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2021-03-25 14:24:47,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 166 flow [2021-03-25 14:24:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:24:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:24:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2021-03-25 14:24:47,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2021-03-25 14:24:47,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2021-03-25 14:24:47,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2021-03-25 14:24:47,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:47,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2021-03-25 14:24:47,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:47,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:47,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:47,540 INFO L185 Difference]: Start difference. First operand has 70 places, 58 transitions, 128 flow. Second operand 3 states and 622 transitions. [2021-03-25 14:24:47,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 166 flow [2021-03-25 14:24:47,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:24:47,545 INFO L241 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2021-03-25 14:24:47,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2021-03-25 14:24:47,548 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2021-03-25 14:24:47,548 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:47,548 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 55 transitions, 122 flow [2021-03-25 14:24:47,549 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 122 flow [2021-03-25 14:24:47,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 122 flow [2021-03-25 14:24:47,565 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-03-25 14:24:47,565 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:47,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 55 events. 0/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:24:47,567 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-25 14:24:50,445 WARN L205 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 359 DAG size of output: 358 [2021-03-25 14:24:51,591 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 358 [2021-03-25 14:24:56,200 WARN L205 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 522 DAG size of output: 520 [2021-03-25 14:24:58,640 WARN L205 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 519 [2021-03-25 14:24:59,945 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 351 [2021-03-25 14:25:01,116 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 351 [2021-03-25 14:25:03,602 WARN L205 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 509 [2021-03-25 14:25:06,243 WARN L205 SmtUtils]: Spent 2.64 s on a formula simplification that was a NOOP. DAG size: 509 [2021-03-25 14:25:09,223 WARN L205 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 364 [2021-03-25 14:25:10,655 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 362 [2021-03-25 14:25:15,782 WARN L205 SmtUtils]: Spent 5.12 s on a formula simplification that was a NOOP. DAG size: 525 [2021-03-25 14:25:19,340 WARN L205 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 523 [2021-03-25 14:25:19,664 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-25 14:25:19,793 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-25 14:25:19,910 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-25 14:25:20,026 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-25 14:25:20,317 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:25:20,508 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:25:20,724 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:25:20,915 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:25:20,927 INFO L154 LiptonReduction]: Checked pairs total: 3191 [2021-03-25 14:25:20,927 INFO L156 LiptonReduction]: Total number of compositions: 18 [2021-03-25 14:25:20,927 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33379 [2021-03-25 14:25:20,928 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2021-03-25 14:25:20,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:20,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:20,929 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:20,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:25:20,929 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1906941473, now seen corresponding path program 1 times [2021-03-25 14:25:20,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:20,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003250331] [2021-03-25 14:25:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:21,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:21,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:21,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:21,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:21,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003250331] [2021-03-25 14:25:21,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:21,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:25:21,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725430304] [2021-03-25 14:25:21,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:25:21,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:21,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:25:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:25:21,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 242 [2021-03-25 14:25:21,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:21,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:21,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 242 [2021-03-25 14:25:21,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:21,174 INFO L129 PetriNetUnfolder]: 33/109 cut-off events. [2021-03-25 14:25:21,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:21,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 109 events. 33/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 3 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 175. Up to 55 conditions per place. [2021-03-25 14:25:21,175 INFO L132 encePairwiseOnDemand]: 239/242 looper letters, 8 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2021-03-25 14:25:21,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 116 flow [2021-03-25 14:25:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:25:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:25:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-03-25 14:25:21,181 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90633608815427 [2021-03-25 14:25:21,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-03-25 14:25:21,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-03-25 14:25:21,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:21,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-03-25 14:25:21,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 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-03-25 14:25:21,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:21,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:21,188 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 658 transitions. [2021-03-25 14:25:21,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 116 flow [2021-03-25 14:25:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:21,189 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 80 flow [2021-03-25 14:25:21,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-25 14:25:21,190 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2021-03-25 14:25:21,190 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:21,190 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 80 flow [2021-03-25 14:25:21,191 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 80 flow [2021-03-25 14:25:21,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 80 flow [2021-03-25 14:25:21,198 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-25 14:25:21,198 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:21,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:25:21,198 INFO L142 LiptonReduction]: Number of co-enabled transitions 490 [2021-03-25 14:25:21,490 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:21,761 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:21,980 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:22,204 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:25:22,549 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-25 14:25:22,842 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-25 14:25:22,846 INFO L154 LiptonReduction]: Checked pairs total: 1920 [2021-03-25 14:25:22,846 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:25:22,846 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1656 [2021-03-25 14:25:22,847 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-25 14:25:22,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:22,848 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:22,848 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:22,848 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:25:22,848 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash 881615090, now seen corresponding path program 1 times [2021-03-25 14:25:22,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:22,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628951027] [2021-03-25 14:25:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:23,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:23,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:25:23,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:23,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:25:23,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:23,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:25:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:23,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628951027] [2021-03-25 14:25:23,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:23,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:25:23,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030106518] [2021-03-25 14:25:23,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:25:23,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:23,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:25:23,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:25:23,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 245 [2021-03-25 14:25:23,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:23,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:23,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 245 [2021-03-25 14:25:23,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:23,321 INFO L129 PetriNetUnfolder]: 293/502 cut-off events. [2021-03-25 14:25:23,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:25:23,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 502 events. 293/502 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2590 event pairs, 216 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 940. Up to 431 conditions per place. [2021-03-25 14:25:23,326 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 11 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-25 14:25:23,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 134 flow [2021-03-25 14:25:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:25:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:25:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 826 transitions. [2021-03-25 14:25:23,333 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2021-03-25 14:25:23,333 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 826 transitions. [2021-03-25 14:25:23,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 826 transitions. [2021-03-25 14:25:23,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:23,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 826 transitions. [2021-03-25 14:25:23,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:23,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:23,338 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:23,338 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 4 states and 826 transitions. [2021-03-25 14:25:23,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 134 flow [2021-03-25 14:25:23,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:23,340 INFO L241 Difference]: Finished difference. Result has 45 places, 39 transitions, 128 flow [2021-03-25 14:25:23,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2021-03-25 14:25:23,340 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2021-03-25 14:25:23,340 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:23,340 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 128 flow [2021-03-25 14:25:23,341 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 128 flow [2021-03-25 14:25:23,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 128 flow [2021-03-25 14:25:23,368 INFO L129 PetriNetUnfolder]: 20/109 cut-off events. [2021-03-25 14:25:23,369 INFO L130 PetriNetUnfolder]: For 10/17 co-relation queries the response was YES. [2021-03-25 14:25:23,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 109 events. 20/109 cut-off events. For 10/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 510 event pairs, 6 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 181. Up to 31 conditions per place. [2021-03-25 14:25:23,371 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-25 14:25:25,314 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-25 14:25:25,895 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-25 14:25:26,962 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-25 14:25:27,443 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-25 14:25:27,450 INFO L154 LiptonReduction]: Checked pairs total: 1108 [2021-03-25 14:25:27,451 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:27,451 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4111 [2021-03-25 14:25:27,452 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 126 flow [2021-03-25 14:25:27,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:27,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:27,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:25:27,459 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash 841553222, now seen corresponding path program 1 times [2021-03-25 14:25:27,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:27,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557649079] [2021-03-25 14:25:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:27,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:27,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:27,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557649079] [2021-03-25 14:25:27,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:27,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:25:27,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252103305] [2021-03-25 14:25:27,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:25:27,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:25:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:25:27,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 246 [2021-03-25 14:25:27,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:27,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 246 [2021-03-25 14:25:27,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:27,620 INFO L129 PetriNetUnfolder]: 11/67 cut-off events. [2021-03-25 14:25:27,620 INFO L130 PetriNetUnfolder]: For 32/55 co-relation queries the response was YES. [2021-03-25 14:25:27,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 67 events. 11/67 cut-off events. For 32/55 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 1 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 121. Up to 20 conditions per place. [2021-03-25 14:25:27,622 INFO L132 encePairwiseOnDemand]: 243/246 looper letters, 1 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 14:25:27,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 134 flow [2021-03-25 14:25:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:25:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:25:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2021-03-25 14:25:27,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9119241192411924 [2021-03-25 14:25:27,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2021-03-25 14:25:27,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2021-03-25 14:25:27,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:27,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2021-03-25 14:25:27,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,632 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 126 flow. Second operand 3 states and 673 transitions. [2021-03-25 14:25:27,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 134 flow [2021-03-25 14:25:27,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:25:27,635 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 137 flow [2021-03-25 14:25:27,635 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:25:27,635 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2021-03-25 14:25:27,635 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:27,635 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 137 flow [2021-03-25 14:25:27,636 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 137 flow [2021-03-25 14:25:27,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 137 flow [2021-03-25 14:25:27,649 INFO L129 PetriNetUnfolder]: 15/90 cut-off events. [2021-03-25 14:25:27,649 INFO L130 PetriNetUnfolder]: For 11/21 co-relation queries the response was YES. [2021-03-25 14:25:27,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 90 events. 15/90 cut-off events. For 11/21 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 382 event pairs, 3 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 156. Up to 31 conditions per place. [2021-03-25 14:25:27,651 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-25 14:25:27,862 INFO L154 LiptonReduction]: Checked pairs total: 601 [2021-03-25 14:25:27,863 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:25:27,863 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 228 [2021-03-25 14:25:27,863 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 137 flow [2021-03-25 14:25:27,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:27,864 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:27,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:25:27,864 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash -529997912, now seen corresponding path program 1 times [2021-03-25 14:25:27,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:27,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963241267] [2021-03-25 14:25:27,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:27,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:27,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:27,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963241267] [2021-03-25 14:25:27,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:27,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:25:27,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513297388] [2021-03-25 14:25:27,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:25:27,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:27,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:25:27,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:25:27,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 246 [2021-03-25 14:25:27,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:27,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 246 [2021-03-25 14:25:27,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:27,988 INFO L129 PetriNetUnfolder]: 11/67 cut-off events. [2021-03-25 14:25:27,988 INFO L130 PetriNetUnfolder]: For 49/73 co-relation queries the response was YES. [2021-03-25 14:25:27,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 67 events. 11/67 cut-off events. For 49/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 247 event pairs, 1 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 130. Up to 20 conditions per place. [2021-03-25 14:25:27,989 INFO L132 encePairwiseOnDemand]: 243/246 looper letters, 1 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-03-25 14:25:27,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 143 flow [2021-03-25 14:25:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:25:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:25:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2021-03-25 14:25:27,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159891598915989 [2021-03-25 14:25:27,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2021-03-25 14:25:27,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2021-03-25 14:25:27,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:27,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2021-03-25 14:25:27,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:27,999 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 137 flow. Second operand 3 states and 676 transitions. [2021-03-25 14:25:27,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 143 flow [2021-03-25 14:25:28,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 133 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:28,002 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 135 flow [2021-03-25 14:25:28,002 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2021-03-25 14:25:28,002 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2021-03-25 14:25:28,002 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:28,003 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 38 transitions, 135 flow [2021-03-25 14:25:28,003 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 135 flow [2021-03-25 14:25:28,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 135 flow [2021-03-25 14:25:28,016 INFO L129 PetriNetUnfolder]: 15/90 cut-off events. [2021-03-25 14:25:28,017 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:25:28,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 90 events. 15/90 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 388 event pairs, 3 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 151. Up to 31 conditions per place. [2021-03-25 14:25:28,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 636 [2021-03-25 14:25:28,108 INFO L154 LiptonReduction]: Checked pairs total: 576 [2021-03-25 14:25:28,108 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:25:28,108 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-25 14:25:28,109 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 135 flow [2021-03-25 14:25:28,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:28,109 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:28,109 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:28,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:25:28,110 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash 857090979, now seen corresponding path program 1 times [2021-03-25 14:25:28,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:28,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108043815] [2021-03-25 14:25:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:28,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:28,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:28,323 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:28,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:28,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:28,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:28,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108043815] [2021-03-25 14:25:28,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:28,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:25:28,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782383190] [2021-03-25 14:25:28,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:25:28,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:28,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:25:28,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:25:28,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 246 [2021-03-25 14:25:28,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:28,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:28,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 246 [2021-03-25 14:25:28,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:28,497 INFO L129 PetriNetUnfolder]: 214/427 cut-off events. [2021-03-25 14:25:28,498 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-25 14:25:28,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 427 events. 214/427 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2503 event pairs, 98 based on Foata normal form. 31/385 useless extension candidates. Maximal degree in co-relation 872. Up to 297 conditions per place. [2021-03-25 14:25:28,501 INFO L132 encePairwiseOnDemand]: 239/246 looper letters, 12 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2021-03-25 14:25:28,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 207 flow [2021-03-25 14:25:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:25:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:25:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1079 transitions. [2021-03-25 14:25:28,506 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8772357723577235 [2021-03-25 14:25:28,506 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1079 transitions. [2021-03-25 14:25:28,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1079 transitions. [2021-03-25 14:25:28,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:28,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1079 transitions. [2021-03-25 14:25:28,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 215.8) internal successors, (1079), 5 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:28,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:28,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:28,512 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 135 flow. Second operand 5 states and 1079 transitions. [2021-03-25 14:25:28,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 207 flow [2021-03-25 14:25:28,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:28,514 INFO L241 Difference]: Finished difference. Result has 53 places, 47 transitions, 206 flow [2021-03-25 14:25:28,514 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2021-03-25 14:25:28,515 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2021-03-25 14:25:28,515 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:28,515 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 206 flow [2021-03-25 14:25:28,515 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 206 flow [2021-03-25 14:25:28,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 206 flow [2021-03-25 14:25:28,592 INFO L129 PetriNetUnfolder]: 366/676 cut-off events. [2021-03-25 14:25:28,593 INFO L130 PetriNetUnfolder]: For 445/773 co-relation queries the response was YES. [2021-03-25 14:25:28,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 676 events. 366/676 cut-off events. For 445/773 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4054 event pairs, 117 based on Foata normal form. 3/597 useless extension candidates. Maximal degree in co-relation 1897. Up to 489 conditions per place. [2021-03-25 14:25:28,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 816 [2021-03-25 14:25:29,752 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 247 DAG size of output: 165 [2021-03-25 14:25:30,073 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-03-25 14:25:32,420 WARN L205 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 334 DAG size of output: 230 [2021-03-25 14:25:33,063 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-25 14:25:33,163 INFO L154 LiptonReduction]: Checked pairs total: 1152 [2021-03-25 14:25:33,163 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:25:33,164 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4649 [2021-03-25 14:25:33,164 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 202 flow [2021-03-25 14:25:33,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,165 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:33,165 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:33,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:25:33,165 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash 137807058, now seen corresponding path program 1 times [2021-03-25 14:25:33,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:33,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529374399] [2021-03-25 14:25:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:33,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:33,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:33,349 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:33,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:33,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:33,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:33,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529374399] [2021-03-25 14:25:33,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:33,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:25:33,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532518435] [2021-03-25 14:25:33,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:25:33,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:33,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:25:33,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:25:33,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-25 14:25:33,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:33,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-25 14:25:33,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:33,558 INFO L129 PetriNetUnfolder]: 208/430 cut-off events. [2021-03-25 14:25:33,558 INFO L130 PetriNetUnfolder]: For 362/759 co-relation queries the response was YES. [2021-03-25 14:25:33,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 430 events. 208/430 cut-off events. For 362/759 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2405 event pairs, 27 based on Foata normal form. 70/449 useless extension candidates. Maximal degree in co-relation 1474. Up to 298 conditions per place. [2021-03-25 14:25:33,562 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 13 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2021-03-25 14:25:33,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 312 flow [2021-03-25 14:25:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:25:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:25:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1301 transitions. [2021-03-25 14:25:33,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8778677462887989 [2021-03-25 14:25:33,568 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1301 transitions. [2021-03-25 14:25:33,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1301 transitions. [2021-03-25 14:25:33,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:33,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1301 transitions. [2021-03-25 14:25:33,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:33,574 INFO L185 Difference]: Start difference. First operand has 53 places, 46 transitions, 202 flow. Second operand 6 states and 1301 transitions. [2021-03-25 14:25:33,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 312 flow [2021-03-25 14:25:33,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 303 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:25:33,582 INFO L241 Difference]: Finished difference. Result has 57 places, 51 transitions, 289 flow [2021-03-25 14:25:33,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2021-03-25 14:25:33,582 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2021-03-25 14:25:33,582 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:33,582 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 289 flow [2021-03-25 14:25:33,582 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 289 flow [2021-03-25 14:25:33,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 289 flow [2021-03-25 14:25:33,621 INFO L129 PetriNetUnfolder]: 134/322 cut-off events. [2021-03-25 14:25:33,621 INFO L130 PetriNetUnfolder]: For 799/1142 co-relation queries the response was YES. [2021-03-25 14:25:33,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 322 events. 134/322 cut-off events. For 799/1142 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1849 event pairs, 26 based on Foata normal form. 10/310 useless extension candidates. Maximal degree in co-relation 1278. Up to 224 conditions per place. [2021-03-25 14:25:33,627 INFO L142 LiptonReduction]: Number of co-enabled transitions 904 [2021-03-25 14:25:34,038 INFO L154 LiptonReduction]: Checked pairs total: 1334 [2021-03-25 14:25:34,038 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:34,038 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 456 [2021-03-25 14:25:34,041 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 281 flow [2021-03-25 14:25:34,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:34,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:34,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:25:34,043 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1781480059, now seen corresponding path program 1 times [2021-03-25 14:25:34,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:34,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380421662] [2021-03-25 14:25:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:34,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:34,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:34,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:34,193 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:34,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:34,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:34,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380421662] [2021-03-25 14:25:34,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:34,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:25:34,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559977195] [2021-03-25 14:25:34,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:25:34,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:34,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:25:34,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:25:34,218 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-25 14:25:34,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:34,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-25 14:25:34,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:34,413 INFO L129 PetriNetUnfolder]: 149/316 cut-off events. [2021-03-25 14:25:34,413 INFO L130 PetriNetUnfolder]: For 737/1278 co-relation queries the response was YES. [2021-03-25 14:25:34,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 316 events. 149/316 cut-off events. For 737/1278 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1564 event pairs, 8 based on Foata normal form. 71/344 useless extension candidates. Maximal degree in co-relation 1373. Up to 207 conditions per place. [2021-03-25 14:25:34,417 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 10 selfloop transitions, 18 changer transitions 4/62 dead transitions. [2021-03-25 14:25:34,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 437 flow [2021-03-25 14:25:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:25:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:25:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1518 transitions. [2021-03-25 14:25:34,423 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8779641411220359 [2021-03-25 14:25:34,423 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1518 transitions. [2021-03-25 14:25:34,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1518 transitions. [2021-03-25 14:25:34,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:34,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1518 transitions. [2021-03-25 14:25:34,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 216.85714285714286) internal successors, (1518), 7 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,430 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,430 INFO L185 Difference]: Start difference. First operand has 57 places, 50 transitions, 281 flow. Second operand 7 states and 1518 transitions. [2021-03-25 14:25:34,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 437 flow [2021-03-25 14:25:34,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 375 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 14:25:34,436 INFO L241 Difference]: Finished difference. Result has 60 places, 55 transitions, 341 flow [2021-03-25 14:25:34,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2021-03-25 14:25:34,437 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2021-03-25 14:25:34,437 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:34,437 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 341 flow [2021-03-25 14:25:34,437 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 55 transitions, 341 flow [2021-03-25 14:25:34,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 341 flow [2021-03-25 14:25:34,461 INFO L129 PetriNetUnfolder]: 72/201 cut-off events. [2021-03-25 14:25:34,461 INFO L130 PetriNetUnfolder]: For 389/432 co-relation queries the response was YES. [2021-03-25 14:25:34,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 201 events. 72/201 cut-off events. For 389/432 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 889 event pairs, 8 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 754. Up to 114 conditions per place. [2021-03-25 14:25:34,464 INFO L142 LiptonReduction]: Number of co-enabled transitions 912 [2021-03-25 14:25:34,476 INFO L154 LiptonReduction]: Checked pairs total: 1645 [2021-03-25 14:25:34,477 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:25:34,477 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-25 14:25:34,479 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 331 flow [2021-03-25 14:25:34,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,479 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:34,479 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:34,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:25:34,479 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:34,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1313651072, now seen corresponding path program 1 times [2021-03-25 14:25:34,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:34,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614577612] [2021-03-25 14:25:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:34,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:34,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:34,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:34,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:34,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614577612] [2021-03-25 14:25:34,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:34,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:25:34,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570338953] [2021-03-25 14:25:34,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:25:34,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:34,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:25:34,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:25:34,571 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 247 [2021-03-25 14:25:34,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:34,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 247 [2021-03-25 14:25:34,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:34,647 INFO L129 PetriNetUnfolder]: 114/291 cut-off events. [2021-03-25 14:25:34,647 INFO L130 PetriNetUnfolder]: For 522/563 co-relation queries the response was YES. [2021-03-25 14:25:34,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 291 events. 114/291 cut-off events. For 522/563 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1442 event pairs, 16 based on Foata normal form. 7/273 useless extension candidates. Maximal degree in co-relation 1027. Up to 150 conditions per place. [2021-03-25 14:25:34,650 INFO L132 encePairwiseOnDemand]: 244/247 looper letters, 4 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 14:25:34,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 303 flow [2021-03-25 14:25:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:25:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:25:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 891 transitions. [2021-03-25 14:25:34,656 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9018218623481782 [2021-03-25 14:25:34,656 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 891 transitions. [2021-03-25 14:25:34,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 891 transitions. [2021-03-25 14:25:34,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:34,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 891 transitions. [2021-03-25 14:25:34,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 222.75) internal successors, (891), 4 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,660 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:34,660 INFO L185 Difference]: Start difference. First operand has 60 places, 54 transitions, 331 flow. Second operand 4 states and 891 transitions. [2021-03-25 14:25:34,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 303 flow [2021-03-25 14:25:34,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 262 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 14:25:34,665 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 255 flow [2021-03-25 14:25:34,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-03-25 14:25:34,666 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2021-03-25 14:25:34,666 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:34,666 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 255 flow [2021-03-25 14:25:34,666 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 255 flow [2021-03-25 14:25:34,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 255 flow [2021-03-25 14:25:34,703 INFO L129 PetriNetUnfolder]: 113/294 cut-off events. [2021-03-25 14:25:34,703 INFO L130 PetriNetUnfolder]: For 292/299 co-relation queries the response was YES. [2021-03-25 14:25:34,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 294 events. 113/294 cut-off events. For 292/299 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1520 event pairs, 16 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 846. Up to 108 conditions per place. [2021-03-25 14:25:34,708 INFO L142 LiptonReduction]: Number of co-enabled transitions 828 [2021-03-25 14:25:35,133 INFO L154 LiptonReduction]: Checked pairs total: 586 [2021-03-25 14:25:35,134 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:25:35,134 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 468 [2021-03-25 14:25:35,134 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 255 flow [2021-03-25 14:25:35,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:35,135 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:25:35,135 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:25:35,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:25:35,135 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:25:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:25:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1708776834, now seen corresponding path program 2 times [2021-03-25 14:25:35,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:25:35,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898574756] [2021-03-25 14:25:35,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:25:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:25:35,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:35,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:35,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:35,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:35,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:35,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:35,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:35,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:25:35,319 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:25:35,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:25:35,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:25:35,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:25:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:25:35,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898574756] [2021-03-25 14:25:35,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:25:35,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:25:35,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917731524] [2021-03-25 14:25:35,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:25:35,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:25:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:25:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:25:35,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 247 [2021-03-25 14:25:35,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 212.85714285714286) internal successors, (1490), 7 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:35,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:25:35,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 247 [2021-03-25 14:25:35,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:25:35,604 INFO L129 PetriNetUnfolder]: 246/477 cut-off events. [2021-03-25 14:25:35,604 INFO L130 PetriNetUnfolder]: For 576/918 co-relation queries the response was YES. [2021-03-25 14:25:35,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 477 events. 246/477 cut-off events. For 576/918 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2456 event pairs, 12 based on Foata normal form. 64/464 useless extension candidates. Maximal degree in co-relation 1646. Up to 173 conditions per place. [2021-03-25 14:25:35,609 INFO L132 encePairwiseOnDemand]: 240/247 looper letters, 6 selfloop transitions, 18 changer transitions 5/60 dead transitions. [2021-03-25 14:25:35,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 369 flow [2021-03-25 14:25:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:25:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:25:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1727 transitions. [2021-03-25 14:25:35,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8739878542510121 [2021-03-25 14:25:35,617 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1727 transitions. [2021-03-25 14:25:35,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1727 transitions. [2021-03-25 14:25:35,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:25:35,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1727 transitions. [2021-03-25 14:25:35,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 215.875) internal successors, (1727), 8 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:35,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:35,625 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:25:35,626 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 255 flow. Second operand 8 states and 1727 transitions. [2021-03-25 14:25:35,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 369 flow [2021-03-25 14:25:35,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 343 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-25 14:25:35,633 INFO L241 Difference]: Finished difference. Result has 66 places, 52 transitions, 297 flow [2021-03-25 14:25:35,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=297, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2021-03-25 14:25:35,633 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2021-03-25 14:25:35,634 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:25:35,634 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 52 transitions, 297 flow [2021-03-25 14:25:35,634 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 52 transitions, 297 flow [2021-03-25 14:25:35,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 297 flow [2021-03-25 14:25:35,661 INFO L129 PetriNetUnfolder]: 97/254 cut-off events. [2021-03-25 14:25:35,661 INFO L130 PetriNetUnfolder]: For 383/418 co-relation queries the response was YES. [2021-03-25 14:25:35,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 254 events. 97/254 cut-off events. For 383/418 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1212 event pairs, 12 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 868. Up to 91 conditions per place. [2021-03-25 14:25:35,666 INFO L142 LiptonReduction]: Number of co-enabled transitions 774 [2021-03-25 14:25:40,043 WARN L205 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 442 DAG size of output: 334 [2021-03-25 14:25:41,400 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 302 [2021-03-25 14:25:50,904 WARN L205 SmtUtils]: Spent 9.50 s on a formula simplification. DAG size of input: 644 DAG size of output: 487 [2021-03-25 14:25:55,647 WARN L205 SmtUtils]: Spent 4.72 s on a formula simplification that was a NOOP. DAG size: 452 [2021-03-25 14:25:58,559 WARN L205 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 314 [2021-03-25 14:26:00,716 WARN L205 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 314 [2021-03-25 14:26:05,500 WARN L205 SmtUtils]: Spent 4.78 s on a formula simplification that was a NOOP. DAG size: 464 [2021-03-25 14:26:10,557 WARN L205 SmtUtils]: Spent 5.05 s on a formula simplification that was a NOOP. DAG size: 464 [2021-03-25 14:26:10,570 INFO L154 LiptonReduction]: Checked pairs total: 1721 [2021-03-25 14:26:10,570 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:26:10,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34937 [2021-03-25 14:26:10,571 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 281 flow [2021-03-25 14:26:10,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 212.85714285714286) internal successors, (1490), 7 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:10,572 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:10,572 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:10,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:26:10,572 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1806275826, now seen corresponding path program 1 times [2021-03-25 14:26:10,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:10,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063990594] [2021-03-25 14:26:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:10,791 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:26:10,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:26:10,908 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2021-03-25 14:26:10,914 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-03-25 14:26:10,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 14:26:11,065 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2021-03-25 14:26:11,071 INFO L142 QuantifierPusher]: treesize reduction 18, result has 74.3 percent of original size [2021-03-25 14:26:11,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 14:26:11,224 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2021-03-25 14:26:11,231 INFO L142 QuantifierPusher]: treesize reduction 18, result has 71.9 percent of original size [2021-03-25 14:26:11,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 14:26:11,405 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2021-03-25 14:26:11,410 INFO L142 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-03-25 14:26:11,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:26:11,480 INFO L142 QuantifierPusher]: treesize reduction 17, result has 51.4 percent of original size [2021-03-25 14:26:11,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:26:11,548 INFO L142 QuantifierPusher]: treesize reduction 17, result has 46.9 percent of original size [2021-03-25 14:26:11,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:26:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:26:11,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063990594] [2021-03-25 14:26:11,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:11,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:26:11,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14744069] [2021-03-25 14:26:11,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:26:11,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:26:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:26:11,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 249 [2021-03-25 14:26:11,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 281 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:11,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:11,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 249 [2021-03-25 14:26:11,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:12,409 INFO L129 PetriNetUnfolder]: 482/1006 cut-off events. [2021-03-25 14:26:12,409 INFO L130 PetriNetUnfolder]: For 4058/4948 co-relation queries the response was YES. [2021-03-25 14:26:12,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3525 conditions, 1006 events. 482/1006 cut-off events. For 4058/4948 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6661 event pairs, 29 based on Foata normal form. 114/1035 useless extension candidates. Maximal degree in co-relation 3501. Up to 304 conditions per place. [2021-03-25 14:26:12,419 INFO L132 encePairwiseOnDemand]: 240/249 looper letters, 18 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2021-03-25 14:26:12,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 411 flow [2021-03-25 14:26:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:26:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:26:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1353 transitions. [2021-03-25 14:26:12,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7762478485370051 [2021-03-25 14:26:12,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1353 transitions. [2021-03-25 14:26:12,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1353 transitions. [2021-03-25 14:26:12,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:12,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1353 transitions. [2021-03-25 14:26:12,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.28571428571428) internal successors, (1353), 7 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,433 INFO L185 Difference]: Start difference. First operand has 62 places, 49 transitions, 281 flow. Second operand 7 states and 1353 transitions. [2021-03-25 14:26:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 411 flow [2021-03-25 14:26:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 350 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-25 14:26:12,456 INFO L241 Difference]: Finished difference. Result has 63 places, 59 transitions, 322 flow [2021-03-25 14:26:12,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2021-03-25 14:26:12,456 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2021-03-25 14:26:12,457 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:12,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 322 flow [2021-03-25 14:26:12,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 59 transitions, 322 flow [2021-03-25 14:26:12,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 322 flow [2021-03-25 14:26:12,522 INFO L129 PetriNetUnfolder]: 282/637 cut-off events. [2021-03-25 14:26:12,522 INFO L130 PetriNetUnfolder]: For 901/1121 co-relation queries the response was YES. [2021-03-25 14:26:12,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 637 events. 282/637 cut-off events. For 901/1121 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4189 event pairs, 6 based on Foata normal form. 15/585 useless extension candidates. Maximal degree in co-relation 1887. Up to 194 conditions per place. [2021-03-25 14:26:12,533 INFO L142 LiptonReduction]: Number of co-enabled transitions 1056 [2021-03-25 14:26:12,641 INFO L154 LiptonReduction]: Checked pairs total: 648 [2021-03-25 14:26:12,641 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:12,642 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 185 [2021-03-25 14:26:12,643 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 322 flow [2021-03-25 14:26:12,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,644 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:12,644 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:12,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:26:12,644 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -140865934, now seen corresponding path program 1 times [2021-03-25 14:26:12,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:12,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217467617] [2021-03-25 14:26:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:12,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:12,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:12,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:12,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:12,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:12,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:26:12,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217467617] [2021-03-25 14:26:12,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:12,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:12,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201430329] [2021-03-25 14:26:12,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:12,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:12,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:12,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:12,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 249 [2021-03-25 14:26:12,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:12,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 249 [2021-03-25 14:26:12,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:12,939 INFO L129 PetriNetUnfolder]: 494/1100 cut-off events. [2021-03-25 14:26:12,940 INFO L130 PetriNetUnfolder]: For 2140/2658 co-relation queries the response was YES. [2021-03-25 14:26:12,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 1100 events. 494/1100 cut-off events. For 2140/2658 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8128 event pairs, 32 based on Foata normal form. 48/1004 useless extension candidates. Maximal degree in co-relation 3275. Up to 370 conditions per place. [2021-03-25 14:26:12,950 INFO L132 encePairwiseOnDemand]: 246/249 looper letters, 3 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2021-03-25 14:26:12,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 334 flow [2021-03-25 14:26:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:26:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:26:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2021-03-25 14:26:12,958 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8815261044176707 [2021-03-25 14:26:12,958 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 878 transitions. [2021-03-25 14:26:12,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 878 transitions. [2021-03-25 14:26:12,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:12,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 878 transitions. [2021-03-25 14:26:12,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:12,968 INFO L185 Difference]: Start difference. First operand has 63 places, 59 transitions, 322 flow. Second operand 4 states and 878 transitions. [2021-03-25 14:26:12,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 334 flow [2021-03-25 14:26:12,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 319 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:12,994 INFO L241 Difference]: Finished difference. Result has 67 places, 60 transitions, 320 flow [2021-03-25 14:26:12,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2021-03-25 14:26:12,994 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2021-03-25 14:26:12,994 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:12,994 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 60 transitions, 320 flow [2021-03-25 14:26:12,994 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 60 transitions, 320 flow [2021-03-25 14:26:12,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 60 transitions, 320 flow [2021-03-25 14:26:13,095 INFO L129 PetriNetUnfolder]: 478/1049 cut-off events. [2021-03-25 14:26:13,095 INFO L130 PetriNetUnfolder]: For 1495/1775 co-relation queries the response was YES. [2021-03-25 14:26:13,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1049 events. 478/1049 cut-off events. For 1495/1775 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7689 event pairs, 12 based on Foata normal form. 23/940 useless extension candidates. Maximal degree in co-relation 3035. Up to 338 conditions per place. [2021-03-25 14:26:13,114 INFO L142 LiptonReduction]: Number of co-enabled transitions 1086 [2021-03-25 14:26:13,295 INFO L154 LiptonReduction]: Checked pairs total: 589 [2021-03-25 14:26:13,296 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:13,296 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 302 [2021-03-25 14:26:13,298 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 320 flow [2021-03-25 14:26:13,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:13,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:13,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:13,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:26:13,299 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 848483318, now seen corresponding path program 2 times [2021-03-25 14:26:13,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:13,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630661888] [2021-03-25 14:26:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:13,408 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:13,509 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:13,559 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:26:13,560 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:26:13,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:26:13,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:26:13 BasicIcfg [2021-03-25 14:26:13,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:26:13,721 INFO L168 Benchmark]: Toolchain (without parser) took 114135.22 ms. Allocated memory was 255.9 MB in the beginning and 868.2 MB in the end (delta: 612.4 MB). Free memory was 236.3 MB in the beginning and 326.3 MB in the end (delta: -89.9 MB). Peak memory consumption was 523.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:13,721 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:26:13,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.59 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 236.3 MB in the beginning and 290.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:13,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.72 ms. Allocated memory is still 337.6 MB. Free memory was 290.8 MB in the beginning and 286.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:13,723 INFO L168 Benchmark]: Boogie Preprocessor took 62.81 ms. Allocated memory is still 337.6 MB. Free memory was 286.2 MB in the beginning and 317.0 MB in the end (delta: -30.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:13,725 INFO L168 Benchmark]: RCFGBuilder took 4154.88 ms. Allocated memory was 337.6 MB in the beginning and 406.8 MB in the end (delta: 69.2 MB). Free memory was 317.0 MB in the beginning and 334.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 251.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:13,725 INFO L168 Benchmark]: TraceAbstraction took 109194.81 ms. Allocated memory was 406.8 MB in the beginning and 868.2 MB in the end (delta: 461.4 MB). Free memory was 334.8 MB in the beginning and 326.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 471.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:13,726 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 641.59 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 236.3 MB in the beginning and 290.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.72 ms. Allocated memory is still 337.6 MB. Free memory was 290.8 MB in the beginning and 286.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 62.81 ms. Allocated memory is still 337.6 MB. Free memory was 286.2 MB in the beginning and 317.0 MB in the end (delta: -30.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 4154.88 ms. Allocated memory was 337.6 MB in the beginning and 406.8 MB in the end (delta: 69.2 MB). Free memory was 317.0 MB in the beginning and 334.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 251.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 109194.81 ms. Allocated memory was 406.8 MB in the beginning and 868.2 MB in the end (delta: 461.4 MB). Free memory was 334.8 MB in the beginning and 326.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 471.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22037.8ms, 145 PlacesBefore, 70 PlacesAfterwards, 134 TransitionsBefore, 58 TransitionsAfterwards, 2988 CoEnabledTransitionPairs, 5 FixpointIterations, 41 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 6284 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2637, positive: 2503, positive conditional: 0, positive unconditional: 2503, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1810, positive: 1752, positive conditional: 0, positive unconditional: 1752, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1810, positive: 1752, positive conditional: 0, positive unconditional: 1752, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1810, positive: 1748, positive conditional: 0, positive unconditional: 1748, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1623, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1612, negative conditional: 0, negative unconditional: 1612, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2637, positive: 751, positive conditional: 0, positive unconditional: 751, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 1810, unknown conditional: 0, unknown unconditional: 1810] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33378.1ms, 66 PlacesBefore, 48 PlacesAfterwards, 55 TransitionsBefore, 37 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 4 FixpointIterations, 14 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 3191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 749, positive: 616, positive conditional: 0, positive unconditional: 616, negative: 133, negative conditional: 0, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 119, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 119, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 558, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 546, negative conditional: 0, negative unconditional: 546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 749, positive: 513, positive conditional: 0, positive unconditional: 513, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 119, unknown conditional: 0, unknown unconditional: 119] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1655.0ms, 47 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 31 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 459, positive: 363, positive conditional: 0, positive unconditional: 363, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 459, positive: 359, positive conditional: 0, positive unconditional: 359, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4110.1ms, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1108 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 309, positive: 259, positive conditional: 0, positive unconditional: 259, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 611, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 611, negative conditional: 0, negative unconditional: 611, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 309, positive: 230, positive conditional: 0, positive unconditional: 230, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 227.0ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 601 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 208, negative conditional: 0, negative unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 268, Positive conditional cache size: 0, Positive unconditional cache size: 268, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.4ms, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 576 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 87, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4648.4ms, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 261, positive conditional: 0, positive unconditional: 261, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 11, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 85, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, positive: 252, positive conditional: 0, positive unconditional: 252, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 248, Positive conditional cache size: 0, Positive unconditional cache size: 248, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 455.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 282, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 21, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 395, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 395, negative conditional: 0, negative unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, positive: 227, positive conditional: 0, positive unconditional: 227, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 249, Positive conditional cache size: 0, Positive unconditional cache size: 249, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.7ms, 60 PlacesBefore, 60 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1645 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 392, positive: 342, positive conditional: 0, positive unconditional: 342, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 392, positive: 321, positive conditional: 0, positive unconditional: 321, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 256, Positive conditional cache size: 0, Positive unconditional cache size: 256, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 467.6ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 586 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 418, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 418, negative conditional: 0, negative unconditional: 418, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34936.4ms, 66 PlacesBefore, 62 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1721 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 344, positive: 281, positive conditional: 0, positive unconditional: 281, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 647, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 647, negative conditional: 0, negative unconditional: 647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 344, positive: 262, positive conditional: 0, positive unconditional: 262, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.6ms, 63 PlacesBefore, 63 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1056 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 55, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, positive: 138, positive conditional: 0, positive unconditional: 138, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 301.2ms, 67 PlacesBefore, 67 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 589 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t629; [L921] FCALL, FORK 0 pthread_create(&t629, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L922] 0 pthread_t t630; [L923] FCALL, FORK 0 pthread_create(&t630, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L924] 0 pthread_t t631; [L925] FCALL, FORK 0 pthread_create(&t631, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L926] 0 pthread_t t632; [L927] FCALL, FORK 0 pthread_create(&t632, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L878] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L878] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L842] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L842] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L842] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 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) [L847] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L851] 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 [L893] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L893] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L893] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L933] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L933] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L933] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 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) [L938] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L938] 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) [L938] 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) [L939] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L940] 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 [L941] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L942] 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 [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L950] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L950] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L951] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L951] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L952] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L952] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L953] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L954] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L954] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L955] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=60, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 137 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 108847.5ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2973.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22159.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 44 SDtfs, 35 SDslu, 16 SDs, 0 SdLazy, 277 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 827.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1316.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=8, InterpolantAutomatonStates: 57, 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: 68.5ms SsaConstructionTime, 870.1ms SatisfiabilityAnalysisTime, 1869.8ms InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...