/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/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:20:49,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:20:49,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:20:49,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:20:49,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:20:49,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:20:49,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:20:49,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:20:49,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:20:49,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:20:49,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:20:49,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:20:49,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:20:49,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:20:49,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:20:49,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:20:49,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:20:49,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:20:49,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:20:49,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:20:49,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:20:49,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:20:49,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:20:49,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:20:49,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:20:49,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:20:49,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:20:49,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:20:49,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:20:49,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:20:49,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:20:49,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:20:49,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:20:49,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:20:49,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:20:49,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:20:49,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:20:49,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:20:49,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:20:49,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:20:49,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:20:49,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:20:49,196 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:20:49,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:20:49,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:20:49,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:20:49,199 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:20:49,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:20:49,200 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:20:49,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:20:49,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:20:49,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:20:49,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:20:49,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:20:49,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:20:49,201 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:20:49,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:20:49,201 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:20:49,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:20:49,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:20:49,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:20:49,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:20:49,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:20:49,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:20:49,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:20:49,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:20:49,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:20:49,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:20:49,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:20:49,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:20:49,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:20:49,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:20:49,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:20:49,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:20:49,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:20:49,539 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:20:49,540 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:20:49,540 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2020-10-11 18:20:49,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c4cb77d/b8153ff3507a41c7b476044692c97a0f/FLAG6e74db939 [2020-10-11 18:20:50,190 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:20:50,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2020-10-11 18:20:50,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c4cb77d/b8153ff3507a41c7b476044692c97a0f/FLAG6e74db939 [2020-10-11 18:20:50,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c4cb77d/b8153ff3507a41c7b476044692c97a0f [2020-10-11 18:20:50,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:20:50,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:20:50,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:20:50,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:20:50,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:20:50,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:20:50" (1/1) ... [2020-10-11 18:20:50,473 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 11.10 06:20:50, skipping insertion in model container [2020-10-11 18:20:50,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:20:50" (1/1) ... [2020-10-11 18:20:50,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:20:50,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:20:51,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:20:51,146 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:20:51,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:20:51,315 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:20:51,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51 WrapperNode [2020-10-11 18:20:51,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:20:51,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:20:51,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:20:51,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:20:51,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:20:51,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:20:51,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:20:51,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:20:51,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (1/1) ... [2020-10-11 18:20:51,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:20:51,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:20:51,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:20:51,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:20:51,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (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-11 18:20:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:20:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:20:51,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:20:51,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:20:51,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:20:51,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:20:51,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:20:51,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:20:51,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:20:51,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:20:51,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:20:51,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:20:51,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:20:51,501 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:20:53,385 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:20:53,385 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:20:53,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:20:53 BoogieIcfgContainer [2020-10-11 18:20:53,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:20:53,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:20:53,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:20:53,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:20:53,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:20:50" (1/3) ... [2020-10-11 18:20:53,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776085a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:20:53, skipping insertion in model container [2020-10-11 18:20:53,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:51" (2/3) ... [2020-10-11 18:20:53,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776085a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:20:53, skipping insertion in model container [2020-10-11 18:20:53,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:20:53" (3/3) ... [2020-10-11 18:20:53,397 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2020-10-11 18:20:53,409 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:20:53,417 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:20:53,418 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:20:53,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,448 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,452 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,452 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,452 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:53,488 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:20:53,510 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:20:53,510 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:20:53,510 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:20:53,510 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:20:53,510 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:20:53,511 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:20:53,511 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:20:53,511 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:20:53,525 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-11 18:20:53,572 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-11 18:20:53,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:53,577 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-11 18:20:53,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2020-10-11 18:20:53,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2020-10-11 18:20:53,600 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2020-10-11 18:20:53,601 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:53,601 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:53,602 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] [2020-10-11 18:20:53,603 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2009263669, now seen corresponding path program 1 times [2020-10-11 18:20:53,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:53,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385320451] [2020-10-11 18:20:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:54,030 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-11 18:20:54,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385320451] [2020-10-11 18:20:54,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:54,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:20:54,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357998917] [2020-10-11 18:20:54,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:20:54,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:20:54,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:20:54,155 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 96 [2020-10-11 18:20:54,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 195 flow. Second operand 3 states. [2020-10-11 18:20:54,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:54,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 96 [2020-10-11 18:20:54,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:54,196 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2020-10-11 18:20:54,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:54,196 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 90 events. 0/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:20:54,198 INFO L132 encePairwiseOnDemand]: 91/96 looper letters, 0 selfloop transitions, 2 changer transitions 11/90 dead transitions. [2020-10-11 18:20:54,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 193 flow [2020-10-11 18:20:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:20:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:20:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2020-10-11 18:20:54,217 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9722222222222222 [2020-10-11 18:20:54,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2020-10-11 18:20:54,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2020-10-11 18:20:54,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:54,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2020-10-11 18:20:54,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:20:54,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:20:54,236 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:20:54,239 INFO L185 Difference]: Start difference. First operand has 101 places, 93 transitions, 195 flow. Second operand 3 states and 280 transitions. [2020-10-11 18:20:54,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 90 transitions, 193 flow [2020-10-11 18:20:54,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 90 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:20:54,249 INFO L241 Difference]: Finished difference. Result has 99 places, 79 transitions, 168 flow [2020-10-11 18:20:54,289 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2020-10-11 18:20:54,290 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2020-10-11 18:20:54,290 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 168 flow [2020-10-11 18:20:54,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:20:54,290 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:54,291 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] [2020-10-11 18:20:54,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:20:54,291 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash -384256892, now seen corresponding path program 1 times [2020-10-11 18:20:54,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:54,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611970909] [2020-10-11 18:20:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:54,541 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-11 18:20:54,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611970909] [2020-10-11 18:20:54,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:54,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:20:54,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444136756] [2020-10-11 18:20:54,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:20:54,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:20:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:20:54,681 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 96 [2020-10-11 18:20:54,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 168 flow. Second operand 6 states. [2020-10-11 18:20:54,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:54,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 96 [2020-10-11 18:20:54,683 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:54,814 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-10-11 18:20:54,814 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:54,815 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 91. Up to 7 conditions per place. [2020-10-11 18:20:54,815 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 6 selfloop transitions, 2 changer transitions 10/89 dead transitions. [2020-10-11 18:20:54,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 224 flow [2020-10-11 18:20:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:20:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:20:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 794 transitions. [2020-10-11 18:20:54,822 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9189814814814815 [2020-10-11 18:20:54,822 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 794 transitions. [2020-10-11 18:20:54,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 794 transitions. [2020-10-11 18:20:54,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:54,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 794 transitions. [2020-10-11 18:20:54,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:20:54,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:20:54,829 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:20:54,829 INFO L185 Difference]: Start difference. First operand has 99 places, 79 transitions, 168 flow. Second operand 9 states and 794 transitions. [2020-10-11 18:20:54,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 224 flow [2020-10-11 18:20:54,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:20:54,833 INFO L241 Difference]: Finished difference. Result has 101 places, 79 transitions, 184 flow [2020-10-11 18:20:54,833 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=101, PETRI_TRANSITIONS=79} [2020-10-11 18:20:54,834 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2020-10-11 18:20:54,834 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 79 transitions, 184 flow [2020-10-11 18:20:54,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:20:54,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:54,835 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] [2020-10-11 18:20:54,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:20:54,835 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1448583577, now seen corresponding path program 1 times [2020-10-11 18:20:54,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:54,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484696163] [2020-10-11 18:20:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:55,236 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-11 18:20:55,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484696163] [2020-10-11 18:20:55,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:55,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:20:55,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865263406] [2020-10-11 18:20:55,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:20:55,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:20:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:20:55,920 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 96 [2020-10-11 18:20:55,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 79 transitions, 184 flow. Second operand 11 states. [2020-10-11 18:20:55,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:55,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 96 [2020-10-11 18:20:55,921 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:56,389 INFO L129 PetriNetUnfolder]: 64/248 cut-off events. [2020-10-11 18:20:56,389 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-11 18:20:56,393 INFO L80 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 248 events. 64/248 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 981 event pairs, 25 based on Foata normal form. 6/249 useless extension candidates. Maximal degree in co-relation 426. Up to 81 conditions per place. [2020-10-11 18:20:56,395 INFO L132 encePairwiseOnDemand]: 84/96 looper letters, 13 selfloop transitions, 9 changer transitions 22/107 dead transitions. [2020-10-11 18:20:56,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 346 flow [2020-10-11 18:20:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:20:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:20:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1124 transitions. [2020-10-11 18:20:56,402 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8363095238095238 [2020-10-11 18:20:56,402 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1124 transitions. [2020-10-11 18:20:56,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1124 transitions. [2020-10-11 18:20:56,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:56,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1124 transitions. [2020-10-11 18:20:56,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:20:56,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:20:56,412 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:20:56,412 INFO L185 Difference]: Start difference. First operand has 101 places, 79 transitions, 184 flow. Second operand 14 states and 1124 transitions. [2020-10-11 18:20:56,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 346 flow [2020-10-11 18:20:56,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 314 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:20:56,418 INFO L241 Difference]: Finished difference. Result has 108 places, 83 transitions, 226 flow [2020-10-11 18:20:56,419 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=226, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2020-10-11 18:20:56,419 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2020-10-11 18:20:56,419 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 226 flow [2020-10-11 18:20:56,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:20:56,420 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:56,420 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] [2020-10-11 18:20:56,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:20:56,420 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash 495449988, now seen corresponding path program 1 times [2020-10-11 18:20:56,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:56,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013532722] [2020-10-11 18:20:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:56,603 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-11 18:20:56,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013532722] [2020-10-11 18:20:56,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:56,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:20:56,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845168857] [2020-10-11 18:20:56,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:20:56,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:20:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:20:56,742 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2020-10-11 18:20:56,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 226 flow. Second operand 6 states. [2020-10-11 18:20:56,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:56,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2020-10-11 18:20:56,743 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:56,983 INFO L129 PetriNetUnfolder]: 129/429 cut-off events. [2020-10-11 18:20:56,983 INFO L130 PetriNetUnfolder]: For 132/135 co-relation queries the response was YES. [2020-10-11 18:20:56,988 INFO L80 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 429 events. 129/429 cut-off events. For 132/135 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2285 event pairs, 33 based on Foata normal form. 10/415 useless extension candidates. Maximal degree in co-relation 774. Up to 104 conditions per place. [2020-10-11 18:20:56,991 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 17 selfloop transitions, 14 changer transitions 4/108 dead transitions. [2020-10-11 18:20:56,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 346 flow [2020-10-11 18:20:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:20:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:20:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2020-10-11 18:20:56,994 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2020-10-11 18:20:56,994 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2020-10-11 18:20:56,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2020-10-11 18:20:56,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:56,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2020-10-11 18:20:56,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:20:56,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:20:56,999 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:20:57,000 INFO L185 Difference]: Start difference. First operand has 108 places, 83 transitions, 226 flow. Second operand 9 states and 784 transitions. [2020-10-11 18:20:57,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 346 flow [2020-10-11 18:20:57,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 332 flow, removed 3 selfloop flow, removed 7 redundant places. [2020-10-11 18:20:57,014 INFO L241 Difference]: Finished difference. Result has 108 places, 95 transitions, 312 flow [2020-10-11 18:20:57,014 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=108, PETRI_TRANSITIONS=95} [2020-10-11 18:20:57,015 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2020-10-11 18:20:57,015 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 95 transitions, 312 flow [2020-10-11 18:20:57,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:20:57,015 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:57,016 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] [2020-10-11 18:20:57,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:20:57,016 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1282491068, now seen corresponding path program 1 times [2020-10-11 18:20:57,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:57,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592856589] [2020-10-11 18:20:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:57,184 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-11 18:20:57,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592856589] [2020-10-11 18:20:57,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:57,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:20:57,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512853012] [2020-10-11 18:20:57,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:20:57,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:57,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:20:57,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:20:57,322 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2020-10-11 18:20:57,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 95 transitions, 312 flow. Second operand 7 states. [2020-10-11 18:20:57,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:57,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2020-10-11 18:20:57,324 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:57,640 INFO L129 PetriNetUnfolder]: 115/403 cut-off events. [2020-10-11 18:20:57,640 INFO L130 PetriNetUnfolder]: For 742/1142 co-relation queries the response was YES. [2020-10-11 18:20:57,643 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 403 events. 115/403 cut-off events. For 742/1142 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2142 event pairs, 4 based on Foata normal form. 46/428 useless extension candidates. Maximal degree in co-relation 1119. Up to 125 conditions per place. [2020-10-11 18:20:57,645 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 15 selfloop transitions, 27 changer transitions 8/123 dead transitions. [2020-10-11 18:20:57,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 123 transitions, 593 flow [2020-10-11 18:20:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:20:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:20:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1044 transitions. [2020-10-11 18:20:57,650 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.90625 [2020-10-11 18:20:57,650 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1044 transitions. [2020-10-11 18:20:57,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1044 transitions. [2020-10-11 18:20:57,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:57,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1044 transitions. [2020-10-11 18:20:57,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:20:57,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:20:57,656 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:20:57,656 INFO L185 Difference]: Start difference. First operand has 108 places, 95 transitions, 312 flow. Second operand 12 states and 1044 transitions. [2020-10-11 18:20:57,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 123 transitions, 593 flow [2020-10-11 18:20:57,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:20:57,662 INFO L241 Difference]: Finished difference. Result has 123 places, 111 transitions, 523 flow [2020-10-11 18:20:57,663 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=523, PETRI_PLACES=123, PETRI_TRANSITIONS=111} [2020-10-11 18:20:57,663 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 22 predicate places. [2020-10-11 18:20:57,663 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 111 transitions, 523 flow [2020-10-11 18:20:57,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:20:57,663 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:57,664 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] [2020-10-11 18:20:57,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:20:57,664 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash -894773272, now seen corresponding path program 1 times [2020-10-11 18:20:57,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:57,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103874796] [2020-10-11 18:20:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:57,811 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-11 18:20:57,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103874796] [2020-10-11 18:20:57,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:57,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:20:57,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253343067] [2020-10-11 18:20:57,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:20:57,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:20:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:20:57,978 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2020-10-11 18:20:57,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 111 transitions, 523 flow. Second operand 7 states. [2020-10-11 18:20:57,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:57,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2020-10-11 18:20:57,979 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:58,240 INFO L129 PetriNetUnfolder]: 148/686 cut-off events. [2020-10-11 18:20:58,241 INFO L130 PetriNetUnfolder]: For 1676/2085 co-relation queries the response was YES. [2020-10-11 18:20:58,246 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 686 events. 148/686 cut-off events. For 1676/2085 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4946 event pairs, 15 based on Foata normal form. 7/660 useless extension candidates. Maximal degree in co-relation 2047. Up to 165 conditions per place. [2020-10-11 18:20:58,250 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 19 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2020-10-11 18:20:58,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 125 transitions, 623 flow [2020-10-11 18:20:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:20:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:20:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2020-10-11 18:20:58,253 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9122023809523809 [2020-10-11 18:20:58,253 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 613 transitions. [2020-10-11 18:20:58,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 613 transitions. [2020-10-11 18:20:58,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:58,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 613 transitions. [2020-10-11 18:20:58,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:20:58,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:20:58,258 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:20:58,258 INFO L185 Difference]: Start difference. First operand has 123 places, 111 transitions, 523 flow. Second operand 7 states and 613 transitions. [2020-10-11 18:20:58,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 125 transitions, 623 flow [2020-10-11 18:20:58,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 563 flow, removed 23 selfloop flow, removed 4 redundant places. [2020-10-11 18:20:58,280 INFO L241 Difference]: Finished difference. Result has 130 places, 115 transitions, 508 flow [2020-10-11 18:20:58,280 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=130, PETRI_TRANSITIONS=115} [2020-10-11 18:20:58,282 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 29 predicate places. [2020-10-11 18:20:58,283 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 115 transitions, 508 flow [2020-10-11 18:20:58,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:20:58,283 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:58,283 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] [2020-10-11 18:20:58,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:20:58,284 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 653028000, now seen corresponding path program 2 times [2020-10-11 18:20:58,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:58,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163454972] [2020-10-11 18:20:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:58,535 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-11 18:20:58,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163454972] [2020-10-11 18:20:58,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:58,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:20:58,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781632987] [2020-10-11 18:20:58,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:20:58,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:20:58,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:20:58,741 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2020-10-11 18:20:58,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 115 transitions, 508 flow. Second operand 8 states. [2020-10-11 18:20:58,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:58,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2020-10-11 18:20:58,742 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:59,121 INFO L129 PetriNetUnfolder]: 166/665 cut-off events. [2020-10-11 18:20:59,121 INFO L130 PetriNetUnfolder]: For 1640/3227 co-relation queries the response was YES. [2020-10-11 18:20:59,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 665 events. 166/665 cut-off events. For 1640/3227 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4933 event pairs, 0 based on Foata normal form. 152/770 useless extension candidates. Maximal degree in co-relation 2031. Up to 96 conditions per place. [2020-10-11 18:20:59,129 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 10 selfloop transitions, 32 changer transitions 18/134 dead transitions. [2020-10-11 18:20:59,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 134 transitions, 752 flow [2020-10-11 18:20:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:20:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:20:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1292 transitions. [2020-10-11 18:20:59,134 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8972222222222223 [2020-10-11 18:20:59,134 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1292 transitions. [2020-10-11 18:20:59,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1292 transitions. [2020-10-11 18:20:59,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:59,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1292 transitions. [2020-10-11 18:20:59,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:20:59,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:20:59,142 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:20:59,142 INFO L185 Difference]: Start difference. First operand has 130 places, 115 transitions, 508 flow. Second operand 15 states and 1292 transitions. [2020-10-11 18:20:59,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 134 transitions, 752 flow [2020-10-11 18:20:59,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 134 transitions, 725 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-11 18:20:59,156 INFO L241 Difference]: Finished difference. Result has 145 places, 113 transitions, 563 flow [2020-10-11 18:20:59,157 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=563, PETRI_PLACES=145, PETRI_TRANSITIONS=113} [2020-10-11 18:20:59,157 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 44 predicate places. [2020-10-11 18:20:59,157 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 113 transitions, 563 flow [2020-10-11 18:20:59,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:20:59,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:59,158 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, 1, 1, 1] [2020-10-11 18:20:59,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:20:59,158 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash -83226700, now seen corresponding path program 1 times [2020-10-11 18:20:59,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:59,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188958462] [2020-10-11 18:20:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:59,293 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-11 18:20:59,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188958462] [2020-10-11 18:20:59,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:59,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:20:59,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752839486] [2020-10-11 18:20:59,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:20:59,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:20:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:20:59,572 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2020-10-11 18:20:59,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 113 transitions, 563 flow. Second operand 7 states. [2020-10-11 18:20:59,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:59,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2020-10-11 18:20:59,573 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:59,774 INFO L129 PetriNetUnfolder]: 196/943 cut-off events. [2020-10-11 18:20:59,775 INFO L130 PetriNetUnfolder]: For 2476/2858 co-relation queries the response was YES. [2020-10-11 18:20:59,782 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 943 events. 196/943 cut-off events. For 2476/2858 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8296 event pairs, 0 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 2900. Up to 141 conditions per place. [2020-10-11 18:20:59,785 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 9 selfloop transitions, 2 changer transitions 7/118 dead transitions. [2020-10-11 18:20:59,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 118 transitions, 609 flow [2020-10-11 18:20:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:20:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:20:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2020-10-11 18:20:59,787 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8988095238095238 [2020-10-11 18:20:59,787 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 604 transitions. [2020-10-11 18:20:59,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 604 transitions. [2020-10-11 18:20:59,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:59,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 604 transitions. [2020-10-11 18:20:59,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:20:59,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:20:59,791 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:20:59,791 INFO L185 Difference]: Start difference. First operand has 145 places, 113 transitions, 563 flow. Second operand 7 states and 604 transitions. [2020-10-11 18:20:59,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 118 transitions, 609 flow [2020-10-11 18:20:59,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 118 transitions, 502 flow, removed 20 selfloop flow, removed 18 redundant places. [2020-10-11 18:20:59,815 INFO L241 Difference]: Finished difference. Result has 133 places, 111 transitions, 464 flow [2020-10-11 18:20:59,815 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=133, PETRI_TRANSITIONS=111} [2020-10-11 18:20:59,815 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 32 predicate places. [2020-10-11 18:20:59,816 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 111 transitions, 464 flow [2020-10-11 18:20:59,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:20:59,816 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:59,816 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, 1, 1, 1] [2020-10-11 18:20:59,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:20:59,816 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash -976773112, now seen corresponding path program 2 times [2020-10-11 18:20:59,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:59,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784142553] [2020-10-11 18:20:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:20:59,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:20:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:20:59,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:20:59,941 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:20:59,942 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:20:59,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:20:59,980 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-11 18:20:59,980 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,981 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-11 18:20:59,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,982 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-11 18:20:59,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,982 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-11 18:20:59,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,983 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-11 18:20:59,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,983 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-11 18:20:59,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,984 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-11 18:20:59,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,984 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-11 18:20:59,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,984 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-11 18:20:59,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,985 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-11 18:20:59,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,985 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-11 18:20:59,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,985 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-11 18:20:59,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,987 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-11 18:20:59,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,987 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-11 18:20:59,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,987 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-11 18:20:59,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,988 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-11 18:20:59,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,988 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-11 18:20:59,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,988 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-11 18:20:59,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,989 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-11 18:20:59,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,989 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-11 18:20:59,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,990 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-11 18:20:59,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,990 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-11 18:20:59,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,990 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-11 18:20:59,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,991 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-11 18:20:59,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,991 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-11 18:20:59,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,991 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-11 18:20:59,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,992 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-11 18:20:59,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,992 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-11 18:20:59,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:59,993 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-11 18:20:59,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:21:00,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:21:00 BasicIcfg [2020-10-11 18:21:00,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:21:00,126 INFO L168 Benchmark]: Toolchain (without parser) took 9661.63 ms. Allocated memory was 245.9 MB in the beginning and 526.4 MB in the end (delta: 280.5 MB). Free memory was 201.0 MB in the beginning and 228.2 MB in the end (delta: -27.2 MB). Peak memory consumption was 253.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:21:00,128 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 245.9 MB. Free memory is still 222.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:21:00,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.55 ms. Allocated memory was 245.9 MB in the beginning and 297.8 MB in the end (delta: 51.9 MB). Free memory was 201.0 MB in the beginning and 246.1 MB in the end (delta: -45.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:21:00,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.80 ms. Allocated memory is still 297.8 MB. Free memory was 246.1 MB in the beginning and 241.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:21:00,131 INFO L168 Benchmark]: Boogie Preprocessor took 37.90 ms. Allocated memory is still 297.8 MB. Free memory was 241.0 MB in the beginning and 238.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:21:00,132 INFO L168 Benchmark]: RCFGBuilder took 1962.56 ms. Allocated memory was 297.8 MB in the beginning and 352.3 MB in the end (delta: 54.5 MB). Free memory was 238.5 MB in the beginning and 202.3 MB in the end (delta: 36.2 MB). Peak memory consumption was 94.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:21:00,138 INFO L168 Benchmark]: TraceAbstraction took 6734.46 ms. Allocated memory was 352.3 MB in the beginning and 526.4 MB in the end (delta: 174.1 MB). Free memory was 202.3 MB in the beginning and 228.2 MB in the end (delta: -26.0 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:21:00,145 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.20 ms. Allocated memory is still 245.9 MB. Free memory is still 222.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 850.55 ms. Allocated memory was 245.9 MB in the beginning and 297.8 MB in the end (delta: 51.9 MB). Free memory was 201.0 MB in the beginning and 246.1 MB in the end (delta: -45.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.80 ms. Allocated memory is still 297.8 MB. Free memory was 246.1 MB in the beginning and 241.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.90 ms. Allocated memory is still 297.8 MB. Free memory was 241.0 MB in the beginning and 238.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1962.56 ms. Allocated memory was 297.8 MB in the beginning and 352.3 MB in the end (delta: 54.5 MB). Free memory was 238.5 MB in the beginning and 202.3 MB in the end (delta: 36.2 MB). Peak memory consumption was 94.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6734.46 ms. Allocated memory was 352.3 MB in the beginning and 526.4 MB in the end (delta: 174.1 MB). Free memory was 202.3 MB in the beginning and 228.2 MB in the end (delta: -26.0 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L702] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L704] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L706] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L707] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L708] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L710] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L712] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L713] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L714] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L715] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L716] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L717] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L718] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L719] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L720] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L721] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L722] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1126; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1127; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 0 pthread_t t1128; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 2 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L780] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 y$flush_delayed = weak$$choice2 [L835] 0 y$mem_tmp = y [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L844] 0 y = y$flush_delayed ? y$mem_tmp : y [L845] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 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: 6.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 132 SDtfs, 241 SDslu, 552 SDs, 0 SdLazy, 544 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=7, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 106086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...