/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 17:52:13,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 17:52:13,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 17:52:13,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 17:52:13,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 17:52:13,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 17:52:13,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 17:52:13,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 17:52:13,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 17:52:13,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 17:52:13,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 17:52:13,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 17:52:13,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 17:52:13,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 17:52:13,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 17:52:13,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 17:52:13,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 17:52:13,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 17:52:13,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 17:52:13,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 17:52:13,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 17:52:13,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 17:52:13,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 17:52:13,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 17:52:13,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 17:52:13,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 17:52:13,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 17:52:13,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 17:52:13,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 17:52:13,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 17:52:13,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 17:52:13,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 17:52:13,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 17:52:13,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 17:52:13,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 17:52:13,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 17:52:13,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 17:52:13,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 17:52:13,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 17:52:13,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 17:52:13,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 17:52:13,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 17:52:13,175 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 17:52:13,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 17:52:13,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 17:52:13,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 17:52:13,178 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 17:52:13,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 17:52:13,178 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 17:52:13,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 17:52:13,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 17:52:13,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 17:52:13,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 17:52:13,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 17:52:13,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 17:52:13,179 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 17:52:13,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 17:52:13,180 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 17:52:13,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 17:52:13,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 17:52:13,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 17:52:13,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 17:52:13,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 17:52:13,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 17:52:13,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 17:52:13,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 17:52:13,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 17:52:13,184 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 17:52:13,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 17:52:13,184 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 17:52:13,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 17:52:13,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 17:52:13,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 17:52:13,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 17:52:13,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 17:52:13,530 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 17:52:13,530 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 17:52:13,531 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i [2020-10-09 17:52:13,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328e1fa0c/f418e0b2feb34ab3b5749a5552ccd81f/FLAGb9eeb4549 [2020-10-09 17:52:14,086 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 17:52:14,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i [2020-10-09 17:52:14,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328e1fa0c/f418e0b2feb34ab3b5749a5552ccd81f/FLAGb9eeb4549 [2020-10-09 17:52:14,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328e1fa0c/f418e0b2feb34ab3b5749a5552ccd81f [2020-10-09 17:52:14,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 17:52:14,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 17:52:14,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 17:52:14,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 17:52:14,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 17:52:14,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:52:14" (1/1) ... [2020-10-09 17:52:14,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff41f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:14, skipping insertion in model container [2020-10-09 17:52:14,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:52:14" (1/1) ... [2020-10-09 17:52:14,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 17:52:14,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 17:52:15,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:52:15,084 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 17:52:15,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:52:15,220 INFO L208 MainTranslator]: Completed translation [2020-10-09 17:52:15,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15 WrapperNode [2020-10-09 17:52:15,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 17:52:15,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 17:52:15,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 17:52:15,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 17:52:15,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 17:52:15,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 17:52:15,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 17:52:15,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 17:52:15,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (1/1) ... [2020-10-09 17:52:15,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 17:52:15,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 17:52:15,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 17:52:15,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 17:52:15,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (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 [2020-10-09 17:52:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 17:52:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 17:52:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 17:52:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 17:52:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 17:52:15,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 17:52:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 17:52:15,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 17:52:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 17:52:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 17:52:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 17:52:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 17:52:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 17:52:15,395 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 17:52:17,326 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 17:52:17,327 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 17:52:17,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:52:17 BoogieIcfgContainer [2020-10-09 17:52:17,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 17:52:17,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 17:52:17,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 17:52:17,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 17:52:17,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 05:52:14" (1/3) ... [2020-10-09 17:52:17,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6243e6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:52:17, skipping insertion in model container [2020-10-09 17:52:17,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:52:15" (2/3) ... [2020-10-09 17:52:17,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6243e6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:52:17, skipping insertion in model container [2020-10-09 17:52:17,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:52:17" (3/3) ... [2020-10-09 17:52:17,340 INFO L111 eAbstractionObserver]: Analyzing ICFG safe024_rmo.opt.i [2020-10-09 17:52:17,352 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 17:52:17,360 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 17:52:17,361 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 17:52:17,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,430 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,430 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,444 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,444 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,452 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,456 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,457 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:52:17,479 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 17:52:17,501 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 17:52:17,501 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 17:52:17,501 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 17:52:17,501 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 17:52:17,501 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 17:52:17,502 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 17:52:17,502 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 17:52:17,502 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 17:52:17,515 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-09 17:52:17,560 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-09 17:52:17,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:52:17,565 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-09 17:52:17,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-09 17:52:17,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-09 17:52:17,591 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2020-10-09 17:52:17,591 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:52:17,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:17,593 INFO L255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:17,593 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash 681669376, now seen corresponding path program 1 times [2020-10-09 17:52:17,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:17,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7256727] [2020-10-09 17:52:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:52:17,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:52:17,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:17,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:17,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:17,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7256727] [2020-10-09 17:52:17,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:17,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 17:52:17,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224523341] [2020-10-09 17:52:17,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 17:52:17,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 17:52:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 17:52:18,050 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 93 [2020-10-09 17:52:18,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 189 flow. Second operand 4 states. [2020-10-09 17:52:18,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:18,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 93 [2020-10-09 17:52:18,054 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:18,085 INFO L129 PetriNetUnfolder]: 0/87 cut-off events. [2020-10-09 17:52:18,086 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:52:18,086 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 0/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 17:52:18,088 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 0 selfloop transitions, 2 changer transitions 11/87 dead transitions. [2020-10-09 17:52:18,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 187 flow [2020-10-09 17:52:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 17:52:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 17:52:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2020-10-09 17:52:18,103 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9713261648745519 [2020-10-09 17:52:18,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2020-10-09 17:52:18,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2020-10-09 17:52:18,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:18,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2020-10-09 17:52:18,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 17:52:18,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 17:52:18,119 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 17:52:18,121 INFO L185 Difference]: Start difference. First operand has 98 places, 90 transitions, 189 flow. Second operand 3 states and 271 transitions. [2020-10-09 17:52:18,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 187 flow [2020-10-09 17:52:18,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-09 17:52:18,130 INFO L241 Difference]: Finished difference. Result has 96 places, 76 transitions, 162 flow [2020-10-09 17:52:18,133 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=96, PETRI_TRANSITIONS=76} [2020-10-09 17:52:18,133 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2020-10-09 17:52:18,134 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 162 flow [2020-10-09 17:52:18,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 17:52:18,134 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:18,134 INFO L255 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, 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] [2020-10-09 17:52:18,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 17:52:18,345 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1778480883, now seen corresponding path program 1 times [2020-10-09 17:52:18,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:18,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641579422] [2020-10-09 17:52:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:52:18,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 17:52:18,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:18,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:18,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:18,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641579422] [2020-10-09 17:52:18,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:18,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:52:18,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234960094] [2020-10-09 17:52:18,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:52:18,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:52:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:52:18,623 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-09 17:52:18,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 162 flow. Second operand 8 states. [2020-10-09 17:52:18,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:18,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-09 17:52:18,625 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:18,819 INFO L129 PetriNetUnfolder]: 64/240 cut-off events. [2020-10-09 17:52:18,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:52:18,821 INFO L80 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 240 events. 64/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 919 event pairs, 0 based on Foata normal form. 8/244 useless extension candidates. Maximal degree in co-relation 333. Up to 36 conditions per place. [2020-10-09 17:52:18,822 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 10 selfloop transitions, 9 changer transitions 29/114 dead transitions. [2020-10-09 17:52:18,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 334 flow [2020-10-09 17:52:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 17:52:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 17:52:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1011 transitions. [2020-10-09 17:52:18,834 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9059139784946236 [2020-10-09 17:52:18,834 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1011 transitions. [2020-10-09 17:52:18,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1011 transitions. [2020-10-09 17:52:18,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:18,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1011 transitions. [2020-10-09 17:52:18,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 17:52:18,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 17:52:18,851 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 17:52:18,852 INFO L185 Difference]: Start difference. First operand has 96 places, 76 transitions, 162 flow. Second operand 12 states and 1011 transitions. [2020-10-09 17:52:18,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 334 flow [2020-10-09 17:52:18,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 114 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 17:52:18,860 INFO L241 Difference]: Finished difference. Result has 103 places, 82 transitions, 256 flow [2020-10-09 17:52:18,860 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=256, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2020-10-09 17:52:18,861 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2020-10-09 17:52:18,861 INFO L481 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 256 flow [2020-10-09 17:52:18,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:52:18,861 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:18,861 INFO L255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:19,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 17:52:19,073 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1960467497, now seen corresponding path program 1 times [2020-10-09 17:52:19,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:19,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207588135] [2020-10-09 17:52:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:52:19,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 17:52:19,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:19,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:19,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:19,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207588135] [2020-10-09 17:52:19,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:19,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:52:19,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902070028] [2020-10-09 17:52:19,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:52:19,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:52:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:52:19,406 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 93 [2020-10-09 17:52:19,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 256 flow. Second operand 8 states. [2020-10-09 17:52:19,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:19,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 93 [2020-10-09 17:52:19,407 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:19,505 INFO L129 PetriNetUnfolder]: 17/163 cut-off events. [2020-10-09 17:52:19,505 INFO L130 PetriNetUnfolder]: For 250/253 co-relation queries the response was YES. [2020-10-09 17:52:19,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 163 events. 17/163 cut-off events. For 250/253 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 440 event pairs, 3 based on Foata normal form. 4/166 useless extension candidates. Maximal degree in co-relation 314. Up to 26 conditions per place. [2020-10-09 17:52:19,508 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 6 selfloop transitions, 2 changer transitions 10/92 dead transitions. [2020-10-09 17:52:19,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 312 flow [2020-10-09 17:52:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 17:52:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 17:52:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 767 transitions. [2020-10-09 17:52:19,511 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9163679808841099 [2020-10-09 17:52:19,511 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 767 transitions. [2020-10-09 17:52:19,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 767 transitions. [2020-10-09 17:52:19,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:19,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 767 transitions. [2020-10-09 17:52:19,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 17:52:19,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 17:52:19,515 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 17:52:19,515 INFO L185 Difference]: Start difference. First operand has 103 places, 82 transitions, 256 flow. Second operand 9 states and 767 transitions. [2020-10-09 17:52:19,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 312 flow [2020-10-09 17:52:19,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 282 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-09 17:52:19,522 INFO L241 Difference]: Finished difference. Result has 105 places, 82 transitions, 246 flow [2020-10-09 17:52:19,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2020-10-09 17:52:19,522 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2020-10-09 17:52:19,522 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 246 flow [2020-10-09 17:52:19,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:52:19,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:19,523 INFO L255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:19,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 17:52:19,742 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash 896286643, now seen corresponding path program 1 times [2020-10-09 17:52:19,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:19,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716322616] [2020-10-09 17:52:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:52:19,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 17:52:19,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:19,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:19,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:19,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716322616] [2020-10-09 17:52:19,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:19,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-09 17:52:19,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602495412] [2020-10-09 17:52:19,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 17:52:19,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 17:52:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 17:52:20,113 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-09 17:52:20,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 246 flow. Second operand 10 states. [2020-10-09 17:52:20,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:20,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-09 17:52:20,114 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:20,252 INFO L129 PetriNetUnfolder]: 16/122 cut-off events. [2020-10-09 17:52:20,253 INFO L130 PetriNetUnfolder]: For 148/162 co-relation queries the response was YES. [2020-10-09 17:52:20,254 INFO L80 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 122 events. 16/122 cut-off events. For 148/162 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 0 based on Foata normal form. 12/133 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2020-10-09 17:52:20,254 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 4 selfloop transitions, 12 changer transitions 13/95 dead transitions. [2020-10-09 17:52:20,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 95 transitions, 391 flow [2020-10-09 17:52:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 17:52:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-09 17:52:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 911 transitions. [2020-10-09 17:52:20,258 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8905180840664711 [2020-10-09 17:52:20,258 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 911 transitions. [2020-10-09 17:52:20,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 911 transitions. [2020-10-09 17:52:20,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:20,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 911 transitions. [2020-10-09 17:52:20,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-09 17:52:20,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-09 17:52:20,263 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-09 17:52:20,263 INFO L185 Difference]: Start difference. First operand has 105 places, 82 transitions, 246 flow. Second operand 11 states and 911 transitions. [2020-10-09 17:52:20,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 95 transitions, 391 flow [2020-10-09 17:52:20,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 353 flow, removed 16 selfloop flow, removed 9 redundant places. [2020-10-09 17:52:20,268 INFO L241 Difference]: Finished difference. Result has 106 places, 82 transitions, 266 flow [2020-10-09 17:52:20,269 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=266, PETRI_PLACES=106, PETRI_TRANSITIONS=82} [2020-10-09 17:52:20,269 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2020-10-09 17:52:20,269 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 82 transitions, 266 flow [2020-10-09 17:52:20,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 17:52:20,270 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:20,270 INFO L255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:20,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 17:52:20,482 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1706900443, now seen corresponding path program 1 times [2020-10-09 17:52:20,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:20,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71357678] [2020-10-09 17:52:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:52:20,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:52:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:20,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:20,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:20,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71357678] [2020-10-09 17:52:20,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:20,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 17:52:20,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889588673] [2020-10-09 17:52:20,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 17:52:20,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:20,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 17:52:20,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 17:52:21,033 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2020-10-09 17:52:21,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 82 transitions, 266 flow. Second operand 9 states. [2020-10-09 17:52:21,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:21,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2020-10-09 17:52:21,035 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:21,109 INFO L129 PetriNetUnfolder]: 10/130 cut-off events. [2020-10-09 17:52:21,109 INFO L130 PetriNetUnfolder]: For 106/113 co-relation queries the response was YES. [2020-10-09 17:52:21,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 130 events. 10/130 cut-off events. For 106/113 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 0 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 231. Up to 21 conditions per place. [2020-10-09 17:52:21,114 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 9 selfloop transitions, 1 changer transitions 5/87 dead transitions. [2020-10-09 17:52:21,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 87 transitions, 306 flow [2020-10-09 17:52:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 17:52:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 17:52:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 583 transitions. [2020-10-09 17:52:21,117 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2020-10-09 17:52:21,117 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 583 transitions. [2020-10-09 17:52:21,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 583 transitions. [2020-10-09 17:52:21,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:21,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 583 transitions. [2020-10-09 17:52:21,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 17:52:21,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 17:52:21,123 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 17:52:21,123 INFO L185 Difference]: Start difference. First operand has 106 places, 82 transitions, 266 flow. Second operand 7 states and 583 transitions. [2020-10-09 17:52:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 87 transitions, 306 flow [2020-10-09 17:52:21,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 87 transitions, 230 flow, removed 19 selfloop flow, removed 15 redundant places. [2020-10-09 17:52:21,129 INFO L241 Difference]: Finished difference. Result has 98 places, 82 transitions, 203 flow [2020-10-09 17:52:21,129 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2020-10-09 17:52:21,130 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2020-10-09 17:52:21,130 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 203 flow [2020-10-09 17:52:21,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 17:52:21,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:21,130 INFO L255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:21,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 17:52:21,342 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1408814205, now seen corresponding path program 2 times [2020-10-09 17:52:21,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:21,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358464436] [2020-10-09 17:52:21,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:21,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 17:52:21,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 17:52:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:52:21,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:21,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:21,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:21,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358464436] [2020-10-09 17:52:21,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:21,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 17:52:21,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432504431] [2020-10-09 17:52:21,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 17:52:21,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 17:52:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 17:52:21,759 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2020-10-09 17:52:21,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 203 flow. Second operand 9 states. [2020-10-09 17:52:21,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:21,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2020-10-09 17:52:21,761 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:21,854 INFO L129 PetriNetUnfolder]: 12/149 cut-off events. [2020-10-09 17:52:21,854 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2020-10-09 17:52:21,856 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 149 events. 12/149 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 365 event pairs, 0 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 209. Up to 16 conditions per place. [2020-10-09 17:52:21,856 INFO L132 encePairwiseOnDemand]: 85/93 looper letters, 6 selfloop transitions, 4 changer transitions 5/87 dead transitions. [2020-10-09 17:52:21,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 87 transitions, 249 flow [2020-10-09 17:52:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 17:52:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 17:52:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 583 transitions. [2020-10-09 17:52:21,863 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2020-10-09 17:52:21,863 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 583 transitions. [2020-10-09 17:52:21,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 583 transitions. [2020-10-09 17:52:21,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:21,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 583 transitions. [2020-10-09 17:52:21,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 17:52:21,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 17:52:21,868 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 17:52:21,868 INFO L185 Difference]: Start difference. First operand has 98 places, 82 transitions, 203 flow. Second operand 7 states and 583 transitions. [2020-10-09 17:52:21,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 87 transitions, 249 flow [2020-10-09 17:52:21,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 87 transitions, 234 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-09 17:52:21,874 INFO L241 Difference]: Finished difference. Result has 99 places, 82 transitions, 214 flow [2020-10-09 17:52:21,874 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2020-10-09 17:52:21,874 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2020-10-09 17:52:21,874 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 214 flow [2020-10-09 17:52:21,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 17:52:21,875 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:21,875 INFO L255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:22,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 17:52:22,093 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1732285595, now seen corresponding path program 3 times [2020-10-09 17:52:22,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:22,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845738831] [2020-10-09 17:52:22,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:22,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 17:52:22,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 17:52:22,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-09 17:52:22,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:52:22,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 17:52:22,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:52:22,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:52:22,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:52:22,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:52:22,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 17:52:22,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:22,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 3, 3, 2, 1] term [2020-10-09 17:52:22,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:22,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:22,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:22,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:52:22,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:52:22,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:52:22,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:52:22,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:52:22,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:52:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:22,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:52:22,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 17:52:22,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,567 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 17:52:22,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:22,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-09 17:52:22,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:22,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-10-09 17:52:22,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 2, 1] term [2020-10-09 17:52:22,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:22,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,715 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 17:52:22,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 17:52:22,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 2, 2, 2, 1] term [2020-10-09 17:52:22,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:22,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-09 17:52:22,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 17:52:22,939 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2020-10-09 17:52:22,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:52:22,949 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:22,952 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 3, 2, 1] term [2020-10-09 17:52:22,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,954 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:22,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,961 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:22,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:22,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:22,985 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 17:52:22,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:22,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:22,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:52:23,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:23,004 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-09 17:52:23,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,011 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 17:52:23,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 17:52:23,024 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:23,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:23,027 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-09 17:52:23,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:52:23,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,047 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:23,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:23,057 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:23,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:52:23,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:52:23,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,079 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:23,080 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 17:52:23,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,087 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:23,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,099 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:52:23,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:52:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:52:23,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845738831] [2020-10-09 17:52:23,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:52:23,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 15 [2020-10-09 17:52:23,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846294251] [2020-10-09 17:52:23,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-09 17:52:23,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:52:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-09 17:52:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-10-09 17:52:24,300 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2020-10-09 17:52:24,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 214 flow. Second operand 15 states. [2020-10-09 17:52:24,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:52:24,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2020-10-09 17:52:24,302 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:52:24,765 INFO L129 PetriNetUnfolder]: 19/185 cut-off events. [2020-10-09 17:52:24,765 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2020-10-09 17:52:24,767 INFO L80 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 185 events. 19/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 588 event pairs, 0 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 285. Up to 20 conditions per place. [2020-10-09 17:52:24,767 INFO L132 encePairwiseOnDemand]: 85/93 looper letters, 17 selfloop transitions, 4 changer transitions 9/94 dead transitions. [2020-10-09 17:52:24,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 304 flow [2020-10-09 17:52:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 17:52:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 17:52:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 679 transitions. [2020-10-09 17:52:24,772 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8112305854241338 [2020-10-09 17:52:24,772 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 679 transitions. [2020-10-09 17:52:24,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 679 transitions. [2020-10-09 17:52:24,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:52:24,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 679 transitions. [2020-10-09 17:52:24,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 17:52:24,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 17:52:24,776 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 17:52:24,776 INFO L185 Difference]: Start difference. First operand has 99 places, 82 transitions, 214 flow. Second operand 9 states and 679 transitions. [2020-10-09 17:52:24,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 304 flow [2020-10-09 17:52:24,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 282 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-09 17:52:24,780 INFO L241 Difference]: Finished difference. Result has 104 places, 84 transitions, 228 flow [2020-10-09 17:52:24,781 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2020-10-09 17:52:24,781 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2020-10-09 17:52:24,781 INFO L481 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 228 flow [2020-10-09 17:52:24,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-09 17:52:24,782 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:52:24,782 INFO L255 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:52:25,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 17:52:25,012 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:52:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:52:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1609202895, now seen corresponding path program 4 times [2020-10-09 17:52:25,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:52:25,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667319674] [2020-10-09 17:52:25,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 17:52:25,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 17:52:25,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 17:52:25,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:52:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 17:52:25,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:52:25,320 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 17:52:25,320 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 17:52:25,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 17:52:25,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:52:25,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:52:25,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 05:52:25 BasicIcfg [2020-10-09 17:52:25,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 17:52:25,703 INFO L168 Benchmark]: Toolchain (without parser) took 11256.46 ms. Allocated memory was 249.6 MB in the beginning and 502.3 MB in the end (delta: 252.7 MB). Free memory was 204.9 MB in the beginning and 392.4 MB in the end (delta: -187.5 MB). Peak memory consumption was 65.2 MB. Max. memory is 14.2 GB. [2020-10-09 17:52:25,704 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:52:25,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.64 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.9 MB in the beginning and 256.8 MB in the end (delta: -51.9 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. [2020-10-09 17:52:25,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.89 ms. Allocated memory is still 308.8 MB. Free memory was 256.8 MB in the beginning and 254.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 17:52:25,708 INFO L168 Benchmark]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 308.8 MB. Free memory was 254.3 MB in the beginning and 251.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 17:52:25,711 INFO L168 Benchmark]: RCFGBuilder took 2008.54 ms. Allocated memory was 308.8 MB in the beginning and 355.5 MB in the end (delta: 46.7 MB). Free memory was 251.8 MB in the beginning and 209.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 14.2 GB. [2020-10-09 17:52:25,712 INFO L168 Benchmark]: TraceAbstraction took 8368.04 ms. Allocated memory was 355.5 MB in the beginning and 502.3 MB in the end (delta: 146.8 MB). Free memory was 209.8 MB in the beginning and 392.4 MB in the end (delta: -182.6 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:52:25,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 775.64 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.9 MB in the beginning and 256.8 MB in the end (delta: -51.9 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 58.89 ms. Allocated memory is still 308.8 MB. Free memory was 256.8 MB in the beginning and 254.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 308.8 MB. Free memory was 254.3 MB in the beginning and 251.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2008.54 ms. Allocated memory was 308.8 MB in the beginning and 355.5 MB in the end (delta: 46.7 MB). Free memory was 251.8 MB in the beginning and 209.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8368.04 ms. Allocated memory was 355.5 MB in the beginning and 502.3 MB in the end (delta: 146.8 MB). Free memory was 209.8 MB in the beginning and 392.4 MB in the end (delta: -182.6 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L703] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L705] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L710] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L711] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L712] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L713] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L714] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L717] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0] [L718] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L719] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L720] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L721] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L722] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L723] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L724] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L725] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L730] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L731] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t2360; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L823] FCALL, FORK 0 pthread_create(&t2360, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] 0 pthread_t t2361; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L825] FCALL, FORK 0 pthread_create(&t2361, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 0 pthread_t t2362; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L827] FCALL, FORK 0 pthread_create(&t2362, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 1 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L794] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L735] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L749] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 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) [L780] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L780] 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) [L780] 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) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 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 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 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) [L800] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L800] 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) [L800] 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) [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L802] 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 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L804] 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 [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 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) [L833] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L833] 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) [L833] 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) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L835] 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 [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L837] 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 [L840] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L8] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L8] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 242 SDslu, 685 SDs, 0 SdLazy, 580 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 799 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 172269 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1261 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...