/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/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:21:49,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:21:49,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:21:49,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:21:49,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:21:49,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:21:49,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:21:49,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:21:49,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:21:49,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:21:49,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:21:49,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:21:49,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:21:49,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:21:49,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:21:49,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:21:49,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:21:49,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:21:49,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:21:49,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:21:49,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:21:49,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:21:49,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:21:49,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:21:49,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:21:49,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:21:49,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:21:49,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:21:49,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:21:49,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:21:49,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:21:49,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:21:49,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:21:49,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:21:49,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:21:49,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:21:49,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:21:49,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:21:49,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:21:49,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:21:49,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:21:49,313 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:21:49,362 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:21:49,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:21:49,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:21:49,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:21:49,364 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:21:49,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:21:49,364 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:21:49,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:21:49,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:21:49,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:21:49,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:21:49,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:21:49,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:21:49,366 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:21:49,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:21:49,366 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:21:49,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:21:49,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:21:49,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:21:49,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:21:49,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:21:49,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:21:49,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:21:49,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:21:49,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:21:49,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:21:49,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:21:49,368 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:21:49,369 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:21:49,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:21:49,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:21:49,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:21:49,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:21:49,710 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:21:49,712 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:21:49,713 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2020-10-11 18:21:49,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd339b29/d4814f593c8c48c099e35ac500d7f3f4/FLAG1a17813ff [2020-10-11 18:21:50,346 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:21:50,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2020-10-11 18:21:50,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd339b29/d4814f593c8c48c099e35ac500d7f3f4/FLAG1a17813ff [2020-10-11 18:21:50,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd339b29/d4814f593c8c48c099e35ac500d7f3f4 [2020-10-11 18:21:50,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:21:50,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:21:50,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:21:50,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:21:50,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:21:50,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:50" (1/1) ... [2020-10-11 18:21:50,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48fa057d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:50, skipping insertion in model container [2020-10-11 18:21:50,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:21:50" (1/1) ... [2020-10-11 18:21:50,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:21:50,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:21:51,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:21:51,287 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:21:51,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:21:51,426 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:21:51,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51 WrapperNode [2020-10-11 18:21:51,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:21:51,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:21:51,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:21:51,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:21:51,437 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:21:51" (1/1) ... [2020-10-11 18:21:51,459 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:21:51" (1/1) ... [2020-10-11 18:21:51,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:21:51,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:21:51,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:21:51,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:21:51,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (1/1) ... [2020-10-11 18:21:51,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:21:51,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:21:51,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:21:51,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:21:51,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21: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:21:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:21:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:21:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:21:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:21:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:21:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:21:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:21:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:21:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:21:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:21:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:21:51,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:21:51,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:21:51,623 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:21:53,511 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:21:53,512 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:21:53,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:53 BoogieIcfgContainer [2020-10-11 18:21:53,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:21:53,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:21:53,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:21:53,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:21:53,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:21:50" (1/3) ... [2020-10-11 18:21:53,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b21b3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:53, skipping insertion in model container [2020-10-11 18:21:53,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:21:51" (2/3) ... [2020-10-11 18:21:53,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b21b3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:21:53, skipping insertion in model container [2020-10-11 18:21:53,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:21:53" (3/3) ... [2020-10-11 18:21:53,525 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2020-10-11 18:21:53,537 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:21:53,545 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:21:53,547 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:21:53,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,589 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,589 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,589 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,605 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,605 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:21:53,622 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:21:53,643 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:21:53,644 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:21:53,644 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:21:53,644 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:21:53,644 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:21:53,644 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:21:53,644 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:21:53,644 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:21:53,658 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-11 18:21:53,704 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-11 18:21:53,705 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:53,710 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-11 18:21:53,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-11 18:21:53,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-11 18:21:53,733 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2020-10-11 18:21:53,736 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:53,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:53,737 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] [2020-10-11 18:21:53,738 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:21:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash -903219512, now seen corresponding path program 1 times [2020-10-11 18:21:53,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:53,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051000428] [2020-10-11 18:21:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:54,080 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:21:54,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051000428] [2020-10-11 18:21:54,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:54,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:21:54,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772944076] [2020-10-11 18:21:54,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:21:54,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:21:54,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:21:54,211 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 95 [2020-10-11 18:21:54,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states. [2020-10-11 18:21:54,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:54,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 95 [2020-10-11 18:21:54,215 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:54,278 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2020-10-11 18:21:54,278 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:54,278 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 0/89 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/91 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:21:54,280 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 0 selfloop transitions, 2 changer transitions 11/89 dead transitions. [2020-10-11 18:21:54,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 191 flow [2020-10-11 18:21:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:21:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:21:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2020-10-11 18:21:54,297 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9719298245614035 [2020-10-11 18:21:54,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2020-10-11 18:21:54,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2020-10-11 18:21:54,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:54,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2020-10-11 18:21:54,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:21:54,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:21:54,313 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:21:54,315 INFO L185 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states and 277 transitions. [2020-10-11 18:21:54,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 191 flow [2020-10-11 18:21:54,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:21:54,324 INFO L241 Difference]: Finished difference. Result has 98 places, 78 transitions, 166 flow [2020-10-11 18:21:54,327 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2020-10-11 18:21:54,327 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2020-10-11 18:21:54,328 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 166 flow [2020-10-11 18:21:54,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:21:54,328 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:54,328 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:21:54,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:21:54,328 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:21:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1892047465, now seen corresponding path program 1 times [2020-10-11 18:21:54,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:54,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923063254] [2020-10-11 18:21:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:54,644 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:21:54,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923063254] [2020-10-11 18:21:54,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:54,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:21:54,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137798306] [2020-10-11 18:21:54,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:21:54,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:54,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:21:54,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:21:54,777 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 95 [2020-10-11 18:21:54,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 166 flow. Second operand 6 states. [2020-10-11 18:21:54,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:54,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 95 [2020-10-11 18:21:54,778 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:54,955 INFO L129 PetriNetUnfolder]: 24/164 cut-off events. [2020-10-11 18:21:54,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:21:54,956 INFO L80 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 164 events. 24/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 517 event pairs, 5 based on Foata normal form. 4/166 useless extension candidates. Maximal degree in co-relation 195. Up to 31 conditions per place. [2020-10-11 18:21:54,957 INFO L132 encePairwiseOnDemand]: 88/95 looper letters, 8 selfloop transitions, 3 changer transitions 19/99 dead transitions. [2020-10-11 18:21:54,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 99 transitions, 268 flow [2020-10-11 18:21:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:21:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:21:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 788 transitions. [2020-10-11 18:21:54,966 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9216374269005848 [2020-10-11 18:21:54,967 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 788 transitions. [2020-10-11 18:21:54,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 788 transitions. [2020-10-11 18:21:54,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:54,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 788 transitions. [2020-10-11 18:21:54,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:21:54,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:21:54,976 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:21:54,976 INFO L185 Difference]: Start difference. First operand has 98 places, 78 transitions, 166 flow. Second operand 9 states and 788 transitions. [2020-10-11 18:21:54,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 99 transitions, 268 flow [2020-10-11 18:21:54,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:21:54,981 INFO L241 Difference]: Finished difference. Result has 100 places, 80 transitions, 205 flow [2020-10-11 18:21:54,981 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=100, PETRI_TRANSITIONS=80} [2020-10-11 18:21:54,982 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2020-10-11 18:21:54,982 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 80 transitions, 205 flow [2020-10-11 18:21:54,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:21:54,982 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:54,983 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] [2020-10-11 18:21:54,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:21:54,983 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:21:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 80117704, now seen corresponding path program 1 times [2020-10-11 18:21:54,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:54,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373906028] [2020-10-11 18:21:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:55,204 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:21:55,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373906028] [2020-10-11 18:21:55,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:55,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:21:55,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297794994] [2020-10-11 18:21:55,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:21:55,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:21:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:21:55,383 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2020-10-11 18:21:55,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 80 transitions, 205 flow. Second operand 6 states. [2020-10-11 18:21:55,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:55,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2020-10-11 18:21:55,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:55,527 INFO L129 PetriNetUnfolder]: 26/195 cut-off events. [2020-10-11 18:21:55,528 INFO L130 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2020-10-11 18:21:55,529 INFO L80 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 195 events. 26/195 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 728 event pairs, 8 based on Foata normal form. 6/196 useless extension candidates. Maximal degree in co-relation 351. Up to 28 conditions per place. [2020-10-11 18:21:55,531 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 6 selfloop transitions, 2 changer transitions 10/90 dead transitions. [2020-10-11 18:21:55,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 279 flow [2020-10-11 18:21:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:21:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:21:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions. [2020-10-11 18:21:55,534 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2020-10-11 18:21:55,534 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions. [2020-10-11 18:21:55,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions. [2020-10-11 18:21:55,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:55,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions. [2020-10-11 18:21:55,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:21:55,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:21:55,539 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:21:55,540 INFO L185 Difference]: Start difference. First operand has 100 places, 80 transitions, 205 flow. Second operand 9 states and 785 transitions. [2020-10-11 18:21:55,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 90 transitions, 279 flow [2020-10-11 18:21:55,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 90 transitions, 262 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:21:55,545 INFO L241 Difference]: Finished difference. Result has 105 places, 80 transitions, 216 flow [2020-10-11 18:21:55,545 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=105, PETRI_TRANSITIONS=80} [2020-10-11 18:21:55,546 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2020-10-11 18:21:55,546 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 80 transitions, 216 flow [2020-10-11 18:21:55,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:21:55,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:55,546 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] [2020-10-11 18:21:55,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:21:55,547 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:21:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash 433475973, now seen corresponding path program 1 times [2020-10-11 18:21:55,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:55,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19381878] [2020-10-11 18:21:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:55,841 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:21:55,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19381878] [2020-10-11 18:21:55,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:55,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:21:55,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582780787] [2020-10-11 18:21:55,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:21:55,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:21:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:21:56,340 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2020-10-11 18:21:56,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 80 transitions, 216 flow. Second operand 10 states. [2020-10-11 18:21:56,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:56,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2020-10-11 18:21:56,341 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:56,986 INFO L129 PetriNetUnfolder]: 216/547 cut-off events. [2020-10-11 18:21:56,987 INFO L130 PetriNetUnfolder]: For 664/665 co-relation queries the response was YES. [2020-10-11 18:21:56,993 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 547 events. 216/547 cut-off events. For 664/665 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2931 event pairs, 71 based on Foata normal form. 14/539 useless extension candidates. Maximal degree in co-relation 1320. Up to 210 conditions per place. [2020-10-11 18:21:56,996 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 14 selfloop transitions, 10 changer transitions 32/121 dead transitions. [2020-10-11 18:21:56,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 121 transitions, 454 flow [2020-10-11 18:21:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:21:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:21:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1291 transitions. [2020-10-11 18:21:57,026 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8493421052631579 [2020-10-11 18:21:57,027 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1291 transitions. [2020-10-11 18:21:57,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1291 transitions. [2020-10-11 18:21:57,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:57,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1291 transitions. [2020-10-11 18:21:57,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:21:57,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:21:57,034 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:21:57,035 INFO L185 Difference]: Start difference. First operand has 105 places, 80 transitions, 216 flow. Second operand 16 states and 1291 transitions. [2020-10-11 18:21:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 121 transitions, 454 flow [2020-10-11 18:21:57,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 121 transitions, 414 flow, removed 18 selfloop flow, removed 8 redundant places. [2020-10-11 18:21:57,042 INFO L241 Difference]: Finished difference. Result has 118 places, 87 transitions, 282 flow [2020-10-11 18:21:57,042 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=282, PETRI_PLACES=118, PETRI_TRANSITIONS=87} [2020-10-11 18:21:57,043 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2020-10-11 18:21:57,043 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 87 transitions, 282 flow [2020-10-11 18:21:57,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:21:57,043 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:57,043 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] [2020-10-11 18:21:57,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:21:57,044 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:21:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash -270037077, now seen corresponding path program 2 times [2020-10-11 18:21:57,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:57,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744827645] [2020-10-11 18:21:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:57,291 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:21:57,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744827645] [2020-10-11 18:21:57,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:57,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:21:57,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105502433] [2020-10-11 18:21:57,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:21:57,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:21:57,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:21:57,754 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2020-10-11 18:21:57,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 87 transitions, 282 flow. Second operand 10 states. [2020-10-11 18:21:57,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:57,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2020-10-11 18:21:57,755 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:58,113 INFO L129 PetriNetUnfolder]: 174/517 cut-off events. [2020-10-11 18:21:58,114 INFO L130 PetriNetUnfolder]: For 1329/1370 co-relation queries the response was YES. [2020-10-11 18:21:58,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 517 events. 174/517 cut-off events. For 1329/1370 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2878 event pairs, 66 based on Foata normal form. 21/518 useless extension candidates. Maximal degree in co-relation 1572. Up to 175 conditions per place. [2020-10-11 18:21:58,122 INFO L132 encePairwiseOnDemand]: 84/95 looper letters, 15 selfloop transitions, 12 changer transitions 22/114 dead transitions. [2020-10-11 18:21:58,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 532 flow [2020-10-11 18:21:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:21:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:21:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1046 transitions. [2020-10-11 18:21:58,126 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8469635627530364 [2020-10-11 18:21:58,127 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1046 transitions. [2020-10-11 18:21:58,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1046 transitions. [2020-10-11 18:21:58,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:58,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1046 transitions. [2020-10-11 18:21:58,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:21:58,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:21:58,133 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:21:58,133 INFO L185 Difference]: Start difference. First operand has 118 places, 87 transitions, 282 flow. Second operand 13 states and 1046 transitions. [2020-10-11 18:21:58,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 532 flow [2020-10-11 18:21:58,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 500 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:21:58,140 INFO L241 Difference]: Finished difference. Result has 121 places, 91 transitions, 343 flow [2020-10-11 18:21:58,141 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=121, PETRI_TRANSITIONS=91} [2020-10-11 18:21:58,141 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 21 predicate places. [2020-10-11 18:21:58,141 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 91 transitions, 343 flow [2020-10-11 18:21:58,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:21:58,141 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:58,141 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:21:58,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:21:58,142 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:21:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1751835171, now seen corresponding path program 1 times [2020-10-11 18:21:58,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:58,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845676746] [2020-10-11 18:21:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:21:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:21:58,410 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:21:58,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845676746] [2020-10-11 18:21:58,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:21:58,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:21:58,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784796202] [2020-10-11 18:21:58,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:21:58,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:21:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:21:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:21:59,559 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-11 18:21:59,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 91 transitions, 343 flow. Second operand 11 states. [2020-10-11 18:21:59,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:21:59,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-11 18:21:59,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:21:59,963 INFO L129 PetriNetUnfolder]: 150/415 cut-off events. [2020-10-11 18:21:59,964 INFO L130 PetriNetUnfolder]: For 1730/1789 co-relation queries the response was YES. [2020-10-11 18:21:59,967 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 415 events. 150/415 cut-off events. For 1730/1789 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2003 event pairs, 19 based on Foata normal form. 14/417 useless extension candidates. Maximal degree in co-relation 1594. Up to 163 conditions per place. [2020-10-11 18:21:59,972 INFO L132 encePairwiseOnDemand]: 84/95 looper letters, 22 selfloop transitions, 12 changer transitions 19/117 dead transitions. [2020-10-11 18:21:59,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 687 flow [2020-10-11 18:21:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:21:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:21:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1033 transitions. [2020-10-11 18:21:59,977 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8364372469635628 [2020-10-11 18:21:59,977 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1033 transitions. [2020-10-11 18:21:59,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1033 transitions. [2020-10-11 18:21:59,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:21:59,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1033 transitions. [2020-10-11 18:21:59,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:21:59,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:21:59,984 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:21:59,984 INFO L185 Difference]: Start difference. First operand has 121 places, 91 transitions, 343 flow. Second operand 13 states and 1033 transitions. [2020-10-11 18:21:59,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 687 flow [2020-10-11 18:21:59,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 660 flow, removed 9 selfloop flow, removed 7 redundant places. [2020-10-11 18:21:59,993 INFO L241 Difference]: Finished difference. Result has 127 places, 95 transitions, 415 flow [2020-10-11 18:21:59,994 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=415, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2020-10-11 18:21:59,994 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 27 predicate places. [2020-10-11 18:21:59,994 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 415 flow [2020-10-11 18:21:59,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:21:59,995 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:21:59,995 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:21:59,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:21:59,995 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:21:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:21:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1390770043, now seen corresponding path program 2 times [2020-10-11 18:21:59,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:21:59,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751152147] [2020-10-11 18:21:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:00,212 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:22:00,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751152147] [2020-10-11 18:22:00,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:00,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:22:00,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775376051] [2020-10-11 18:22:00,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:22:00,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:22:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:22:01,119 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2020-10-11 18:22:01,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 415 flow. Second operand 9 states. [2020-10-11 18:22:01,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:01,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2020-10-11 18:22:01,120 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:01,383 INFO L129 PetriNetUnfolder]: 141/422 cut-off events. [2020-10-11 18:22:01,383 INFO L130 PetriNetUnfolder]: For 2892/2957 co-relation queries the response was YES. [2020-10-11 18:22:01,387 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 422 events. 141/422 cut-off events. For 2892/2957 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2104 event pairs, 17 based on Foata normal form. 15/424 useless extension candidates. Maximal degree in co-relation 1820. Up to 138 conditions per place. [2020-10-11 18:22:01,391 INFO L132 encePairwiseOnDemand]: 84/95 looper letters, 25 selfloop transitions, 14 changer transitions 10/115 dead transitions. [2020-10-11 18:22:01,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 115 transitions, 735 flow [2020-10-11 18:22:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2020-10-11 18:22:01,397 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8619883040935673 [2020-10-11 18:22:01,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 737 transitions. [2020-10-11 18:22:01,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 737 transitions. [2020-10-11 18:22:01,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:01,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 737 transitions. [2020-10-11 18:22:01,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:01,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:01,402 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:01,402 INFO L185 Difference]: Start difference. First operand has 127 places, 95 transitions, 415 flow. Second operand 9 states and 737 transitions. [2020-10-11 18:22:01,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 115 transitions, 735 flow [2020-10-11 18:22:01,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 115 transitions, 642 flow, removed 45 selfloop flow, removed 8 redundant places. [2020-10-11 18:22:01,412 INFO L241 Difference]: Finished difference. Result has 125 places, 100 transitions, 460 flow [2020-10-11 18:22:01,412 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=125, PETRI_TRANSITIONS=100} [2020-10-11 18:22:01,413 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 25 predicate places. [2020-10-11 18:22:01,413 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 100 transitions, 460 flow [2020-10-11 18:22:01,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:22:01,413 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:01,413 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:22:01,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:22:01,414 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:22:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1471392506, now seen corresponding path program 1 times [2020-10-11 18:22:01,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:01,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895160200] [2020-10-11 18:22:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:01,778 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:22:01,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895160200] [2020-10-11 18:22:01,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:01,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:22:01,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142587959] [2020-10-11 18:22:01,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:22:01,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:22:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:22:02,809 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 95 [2020-10-11 18:22:02,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 100 transitions, 460 flow. Second operand 14 states. [2020-10-11 18:22:02,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:02,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 95 [2020-10-11 18:22:02,811 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:03,297 INFO L129 PetriNetUnfolder]: 118/407 cut-off events. [2020-10-11 18:22:03,298 INFO L130 PetriNetUnfolder]: For 1972/2107 co-relation queries the response was YES. [2020-10-11 18:22:03,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 407 events. 118/407 cut-off events. For 1972/2107 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2060 event pairs, 17 based on Foata normal form. 18/412 useless extension candidates. Maximal degree in co-relation 1577. Up to 157 conditions per place. [2020-10-11 18:22:03,305 INFO L132 encePairwiseOnDemand]: 83/95 looper letters, 27 selfloop transitions, 13 changer transitions 10/113 dead transitions. [2020-10-11 18:22:03,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 113 transitions, 694 flow [2020-10-11 18:22:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1162 transitions. [2020-10-11 18:22:03,309 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8154385964912281 [2020-10-11 18:22:03,310 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1162 transitions. [2020-10-11 18:22:03,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1162 transitions. [2020-10-11 18:22:03,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:03,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1162 transitions. [2020-10-11 18:22:03,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:03,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:03,317 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:03,318 INFO L185 Difference]: Start difference. First operand has 125 places, 100 transitions, 460 flow. Second operand 15 states and 1162 transitions. [2020-10-11 18:22:03,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 113 transitions, 694 flow [2020-10-11 18:22:03,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 113 transitions, 664 flow, removed 11 selfloop flow, removed 6 redundant places. [2020-10-11 18:22:03,327 INFO L241 Difference]: Finished difference. Result has 137 places, 101 transitions, 506 flow [2020-10-11 18:22:03,328 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=506, PETRI_PLACES=137, PETRI_TRANSITIONS=101} [2020-10-11 18:22:03,328 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 37 predicate places. [2020-10-11 18:22:03,328 INFO L481 AbstractCegarLoop]: Abstraction has has 137 places, 101 transitions, 506 flow [2020-10-11 18:22:03,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:22:03,328 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:03,329 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:22:03,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:22:03,329 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:22:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -29790680, now seen corresponding path program 2 times [2020-10-11 18:22:03,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:03,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759623504] [2020-10-11 18:22:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:03,624 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:22:03,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759623504] [2020-10-11 18:22:03,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:03,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:22:03,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784830162] [2020-10-11 18:22:03,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:22:03,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:22:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:22:04,841 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2020-10-11 18:22:04,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 101 transitions, 506 flow. Second operand 11 states. [2020-10-11 18:22:04,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:04,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2020-10-11 18:22:04,843 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:05,253 INFO L129 PetriNetUnfolder]: 111/440 cut-off events. [2020-10-11 18:22:05,253 INFO L130 PetriNetUnfolder]: For 2807/2850 co-relation queries the response was YES. [2020-10-11 18:22:05,257 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 440 events. 111/440 cut-off events. For 2807/2850 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2400 event pairs, 14 based on Foata normal form. 19/443 useless extension candidates. Maximal degree in co-relation 1771. Up to 104 conditions per place. [2020-10-11 18:22:05,261 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 24 selfloop transitions, 13 changer transitions 13/119 dead transitions. [2020-10-11 18:22:05,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 119 transitions, 840 flow [2020-10-11 18:22:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:22:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:22:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 996 transitions. [2020-10-11 18:22:05,269 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2020-10-11 18:22:05,269 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 996 transitions. [2020-10-11 18:22:05,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 996 transitions. [2020-10-11 18:22:05,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:05,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 996 transitions. [2020-10-11 18:22:05,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:22:05,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:22:05,276 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:22:05,276 INFO L185 Difference]: Start difference. First operand has 137 places, 101 transitions, 506 flow. Second operand 12 states and 996 transitions. [2020-10-11 18:22:05,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 119 transitions, 840 flow [2020-10-11 18:22:05,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 119 transitions, 719 flow, removed 49 selfloop flow, removed 13 redundant places. [2020-10-11 18:22:05,290 INFO L241 Difference]: Finished difference. Result has 136 places, 101 transitions, 492 flow [2020-10-11 18:22:05,290 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=492, PETRI_PLACES=136, PETRI_TRANSITIONS=101} [2020-10-11 18:22:05,290 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 36 predicate places. [2020-10-11 18:22:05,291 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 101 transitions, 492 flow [2020-10-11 18:22:05,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:22:05,291 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:05,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, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:05,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:22:05,291 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash 812208070, now seen corresponding path program 1 times [2020-10-11 18:22:05,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:05,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761111443] [2020-10-11 18:22:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:05,447 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:22:05,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761111443] [2020-10-11 18:22:05,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:05,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:05,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768836934] [2020-10-11 18:22:05,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:05,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:05,535 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-11 18:22:05,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 101 transitions, 492 flow. Second operand 6 states. [2020-10-11 18:22:05,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:05,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-11 18:22:05,536 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:05,886 INFO L129 PetriNetUnfolder]: 393/1089 cut-off events. [2020-10-11 18:22:05,886 INFO L130 PetriNetUnfolder]: For 2469/2496 co-relation queries the response was YES. [2020-10-11 18:22:05,898 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1089 events. 393/1089 cut-off events. For 2469/2496 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 8150 event pairs, 38 based on Foata normal form. 41/1025 useless extension candidates. Maximal degree in co-relation 2940. Up to 268 conditions per place. [2020-10-11 18:22:05,908 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 19 selfloop transitions, 16 changer transitions 0/126 dead transitions. [2020-10-11 18:22:05,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 126 transitions, 612 flow [2020-10-11 18:22:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 775 transitions. [2020-10-11 18:22:05,913 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2020-10-11 18:22:05,914 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 775 transitions. [2020-10-11 18:22:05,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 775 transitions. [2020-10-11 18:22:05,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:05,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 775 transitions. [2020-10-11 18:22:05,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:05,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:05,922 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:05,922 INFO L185 Difference]: Start difference. First operand has 136 places, 101 transitions, 492 flow. Second operand 9 states and 775 transitions. [2020-10-11 18:22:05,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 126 transitions, 612 flow [2020-10-11 18:22:05,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 126 transitions, 562 flow, removed 15 selfloop flow, removed 13 redundant places. [2020-10-11 18:22:05,945 INFO L241 Difference]: Finished difference. Result has 130 places, 115 transitions, 553 flow [2020-10-11 18:22:05,947 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=553, PETRI_PLACES=130, PETRI_TRANSITIONS=115} [2020-10-11 18:22:05,947 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 30 predicate places. [2020-10-11 18:22:05,947 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 115 transitions, 553 flow [2020-10-11 18:22:05,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:05,948 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:05,948 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:05,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:22:05,948 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1830645820, now seen corresponding path program 1 times [2020-10-11 18:22:05,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:05,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002631725] [2020-10-11 18:22:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:06,173 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:22:06,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002631725] [2020-10-11 18:22:06,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:06,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:06,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676202169] [2020-10-11 18:22:06,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:06,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:06,338 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-11 18:22:06,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 115 transitions, 553 flow. Second operand 7 states. [2020-10-11 18:22:06,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:06,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-11 18:22:06,339 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:06,668 INFO L129 PetriNetUnfolder]: 296/966 cut-off events. [2020-10-11 18:22:06,668 INFO L130 PetriNetUnfolder]: For 2212/4166 co-relation queries the response was YES. [2020-10-11 18:22:06,676 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 966 events. 296/966 cut-off events. For 2212/4166 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7425 event pairs, 23 based on Foata normal form. 180/1056 useless extension candidates. Maximal degree in co-relation 2996. Up to 293 conditions per place. [2020-10-11 18:22:06,681 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 15 selfloop transitions, 31 changer transitions 7/135 dead transitions. [2020-10-11 18:22:06,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 769 flow [2020-10-11 18:22:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:22:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:22:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1034 transitions. [2020-10-11 18:22:06,685 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9070175438596492 [2020-10-11 18:22:06,685 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1034 transitions. [2020-10-11 18:22:06,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1034 transitions. [2020-10-11 18:22:06,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:06,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1034 transitions. [2020-10-11 18:22:06,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:22:06,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:22:06,690 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:22:06,691 INFO L185 Difference]: Start difference. First operand has 130 places, 115 transitions, 553 flow. Second operand 12 states and 1034 transitions. [2020-10-11 18:22:06,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 769 flow [2020-10-11 18:22:06,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 744 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-11 18:22:06,701 INFO L241 Difference]: Finished difference. Result has 139 places, 125 transitions, 685 flow [2020-10-11 18:22:06,702 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=685, PETRI_PLACES=139, PETRI_TRANSITIONS=125} [2020-10-11 18:22:06,702 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2020-10-11 18:22:06,702 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 685 flow [2020-10-11 18:22:06,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:06,702 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:06,702 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] [2020-10-11 18:22:06,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:22:06,703 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash -572298967, now seen corresponding path program 1 times [2020-10-11 18:22:06,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:06,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029203921] [2020-10-11 18:22:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:06,801 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:22:06,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029203921] [2020-10-11 18:22:06,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:06,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:06,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552992926] [2020-10-11 18:22:06,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:06,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:06,931 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 95 [2020-10-11 18:22:06,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 685 flow. Second operand 6 states. [2020-10-11 18:22:06,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:06,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 95 [2020-10-11 18:22:06,932 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:07,202 INFO L129 PetriNetUnfolder]: 317/1168 cut-off events. [2020-10-11 18:22:07,203 INFO L130 PetriNetUnfolder]: For 3705/4564 co-relation queries the response was YES. [2020-10-11 18:22:07,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3938 conditions, 1168 events. 317/1168 cut-off events. For 3705/4564 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9805 event pairs, 13 based on Foata normal form. 19/1088 useless extension candidates. Maximal degree in co-relation 3865. Up to 354 conditions per place. [2020-10-11 18:22:07,216 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 12 selfloop transitions, 3 changer transitions 10/139 dead transitions. [2020-10-11 18:22:07,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 825 flow [2020-10-11 18:22:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 782 transitions. [2020-10-11 18:22:07,218 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9146198830409357 [2020-10-11 18:22:07,218 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 782 transitions. [2020-10-11 18:22:07,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 782 transitions. [2020-10-11 18:22:07,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:07,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 782 transitions. [2020-10-11 18:22:07,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:07,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:07,222 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:07,222 INFO L185 Difference]: Start difference. First operand has 139 places, 125 transitions, 685 flow. Second operand 9 states and 782 transitions. [2020-10-11 18:22:07,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 825 flow [2020-10-11 18:22:07,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 703 flow, removed 48 selfloop flow, removed 6 redundant places. [2020-10-11 18:22:07,253 INFO L241 Difference]: Finished difference. Result has 148 places, 125 transitions, 592 flow [2020-10-11 18:22:07,254 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=592, PETRI_PLACES=148, PETRI_TRANSITIONS=125} [2020-10-11 18:22:07,254 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 48 predicate places. [2020-10-11 18:22:07,254 INFO L481 AbstractCegarLoop]: Abstraction has has 148 places, 125 transitions, 592 flow [2020-10-11 18:22:07,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:07,254 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:07,254 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:22:07,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:22:07,255 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1146050673, now seen corresponding path program 1 times [2020-10-11 18:22:07,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:07,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766990752] [2020-10-11 18:22:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:07,374 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:22:07,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766990752] [2020-10-11 18:22:07,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:07,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:22:07,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626646179] [2020-10-11 18:22:07,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:22:07,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:07,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:22:07,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:22:07,580 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-11 18:22:07,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 125 transitions, 592 flow. Second operand 8 states. [2020-10-11 18:22:07,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:07,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-11 18:22:07,582 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:08,000 INFO L129 PetriNetUnfolder]: 355/1161 cut-off events. [2020-10-11 18:22:08,001 INFO L130 PetriNetUnfolder]: For 1563/4234 co-relation queries the response was YES. [2020-10-11 18:22:08,010 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 1161 events. 355/1161 cut-off events. For 1563/4234 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 9920 event pairs, 0 based on Foata normal form. 293/1326 useless extension candidates. Maximal degree in co-relation 3211. Up to 224 conditions per place. [2020-10-11 18:22:08,014 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 10 selfloop transitions, 36 changer transitions 18/144 dead transitions. [2020-10-11 18:22:08,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 814 flow [2020-10-11 18:22:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1281 transitions. [2020-10-11 18:22:08,017 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8989473684210526 [2020-10-11 18:22:08,017 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1281 transitions. [2020-10-11 18:22:08,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1281 transitions. [2020-10-11 18:22:08,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:08,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1281 transitions. [2020-10-11 18:22:08,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:08,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:08,022 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:08,022 INFO L185 Difference]: Start difference. First operand has 148 places, 125 transitions, 592 flow. Second operand 15 states and 1281 transitions. [2020-10-11 18:22:08,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 814 flow [2020-10-11 18:22:08,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 144 transitions, 738 flow, removed 32 selfloop flow, removed 16 redundant places. [2020-10-11 18:22:08,034 INFO L241 Difference]: Finished difference. Result has 146 places, 123 transitions, 618 flow [2020-10-11 18:22:08,035 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=618, PETRI_PLACES=146, PETRI_TRANSITIONS=123} [2020-10-11 18:22:08,035 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 46 predicate places. [2020-10-11 18:22:08,035 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 123 transitions, 618 flow [2020-10-11 18:22:08,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:22:08,035 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:08,036 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] [2020-10-11 18:22:08,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:22:08,036 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:08,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2065578871, now seen corresponding path program 1 times [2020-10-11 18:22:08,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:08,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415628694] [2020-10-11 18:22:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:08,159 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:22:08,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415628694] [2020-10-11 18:22:08,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:08,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:08,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030931669] [2020-10-11 18:22:08,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:08,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:08,329 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2020-10-11 18:22:08,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 123 transitions, 618 flow. Second operand 7 states. [2020-10-11 18:22:08,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:08,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2020-10-11 18:22:08,330 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:08,532 INFO L129 PetriNetUnfolder]: 233/948 cut-off events. [2020-10-11 18:22:08,533 INFO L130 PetriNetUnfolder]: For 1947/2180 co-relation queries the response was YES. [2020-10-11 18:22:08,538 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 948 events. 233/948 cut-off events. For 1947/2180 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8064 event pairs, 0 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 2588. Up to 132 conditions per place. [2020-10-11 18:22:08,541 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 9 selfloop transitions, 1 changer transitions 16/128 dead transitions. [2020-10-11 18:22:08,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 128 transitions, 662 flow [2020-10-11 18:22:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:22:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:22:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 597 transitions. [2020-10-11 18:22:08,543 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8977443609022556 [2020-10-11 18:22:08,543 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 597 transitions. [2020-10-11 18:22:08,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 597 transitions. [2020-10-11 18:22:08,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:08,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 597 transitions. [2020-10-11 18:22:08,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:22:08,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:22:08,545 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:22:08,546 INFO L185 Difference]: Start difference. First operand has 146 places, 123 transitions, 618 flow. Second operand 7 states and 597 transitions. [2020-10-11 18:22:08,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 128 transitions, 662 flow [2020-10-11 18:22:08,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 128 transitions, 595 flow, removed 6 selfloop flow, removed 14 redundant places. [2020-10-11 18:22:08,562 INFO L241 Difference]: Finished difference. Result has 141 places, 112 transitions, 498 flow [2020-10-11 18:22:08,562 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=141, PETRI_TRANSITIONS=112} [2020-10-11 18:22:08,563 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2020-10-11 18:22:08,563 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 112 transitions, 498 flow [2020-10-11 18:22:08,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:08,563 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:08,563 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] [2020-10-11 18:22:08,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:22:08,564 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 447627753, now seen corresponding path program 2 times [2020-10-11 18:22:08,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:08,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890146115] [2020-10-11 18:22:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:22:08,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:22:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:22:08,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:22:08,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:22:08,681 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:22:08,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:22:08,719 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:22:08,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,720 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:22:08,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,721 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:22:08,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,721 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:22:08,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,721 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:22:08,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,722 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:22:08,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,722 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:22:08,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,722 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:22:08,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,723 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:22:08,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,723 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:22:08,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,723 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:22:08,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,724 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:22:08,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,725 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:22:08,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,725 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:22:08,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,726 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:22:08,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,726 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:22:08,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,726 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:22:08,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,726 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:22:08,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,727 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:22:08,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,727 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:22:08,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,728 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:22:08,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,728 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:22:08,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,728 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:22:08,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,729 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:22:08,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,729 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:22:08,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,729 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:22:08,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,730 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:22:08,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,730 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:22:08,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,730 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:22:08,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:08,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:22:08 BasicIcfg [2020-10-11 18:22:08,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:22:08,863 INFO L168 Benchmark]: Toolchain (without parser) took 18228.63 ms. Allocated memory was 255.3 MB in the beginning and 588.3 MB in the end (delta: 332.9 MB). Free memory was 209.8 MB in the beginning and 286.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 256.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:08,866 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 255.3 MB. Free memory is still 231.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:22:08,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.93 ms. Allocated memory was 255.3 MB in the beginning and 323.0 MB in the end (delta: 67.6 MB). Free memory was 209.8 MB in the beginning and 273.2 MB in the end (delta: -63.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:08,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 323.0 MB. Free memory was 273.2 MB in the beginning and 270.6 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:22:08,870 INFO L168 Benchmark]: Boogie Preprocessor took 36.68 ms. Allocated memory is still 323.0 MB. Free memory was 270.6 MB in the beginning and 268.1 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:22:08,871 INFO L168 Benchmark]: RCFGBuilder took 1981.00 ms. Allocated memory was 323.0 MB in the beginning and 363.9 MB in the end (delta: 40.9 MB). Free memory was 268.1 MB in the beginning and 216.1 MB in the end (delta: 52.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:08,871 INFO L168 Benchmark]: TraceAbstraction took 15343.40 ms. Allocated memory was 363.9 MB in the beginning and 588.3 MB in the end (delta: 224.4 MB). Free memory was 216.1 MB in the beginning and 286.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 154.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:08,877 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 255.3 MB. Free memory is still 231.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 792.93 ms. Allocated memory was 255.3 MB in the beginning and 323.0 MB in the end (delta: 67.6 MB). Free memory was 209.8 MB in the beginning and 273.2 MB in the end (delta: -63.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 323.0 MB. Free memory was 273.2 MB in the beginning and 270.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.68 ms. Allocated memory is still 323.0 MB. Free memory was 270.6 MB in the beginning and 268.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1981.00 ms. Allocated memory was 323.0 MB in the beginning and 363.9 MB in the end (delta: 40.9 MB). Free memory was 268.1 MB in the beginning and 216.1 MB in the end (delta: 52.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15343.40 ms. Allocated memory was 363.9 MB in the beginning and 588.3 MB in the end (delta: 224.4 MB). Free memory was 216.1 MB in the beginning and 286.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 154.3 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L702] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L705] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L706] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L708] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L710] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L711] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L712] 0 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L713] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L714] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L715] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L716] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L720] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L721] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L722] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L723] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L724] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L725] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L726] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L728] 0 int z = 0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L812] 0 pthread_t t1214; VAL [__unbuffered_cnt=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] [L813] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L814] 0 pthread_t t1215; VAL [__unbuffered_cnt=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] [L815] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L816] 0 pthread_t t1216; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L734] 1 a = 1 VAL [__unbuffered_cnt=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=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] [L737] 1 x = 1 VAL [__unbuffered_cnt=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] [L749] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L752] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L790] 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) [L790] 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) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 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 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 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 [L755] 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) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] 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) [L755] 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) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 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 [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 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 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=2, 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] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=2, 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] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=2, 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] [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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=2, 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_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=2, 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] [L823] 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) [L823] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L823] 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) [L823] 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) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 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 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 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 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] 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) [L834] 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) [L835] 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)) [L835] 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 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] 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)) [L835] 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)) [L836] 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)) [L836] EXPR 0 !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) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __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=2, 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_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=2, 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_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=2, 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, 94 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: 15.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 285 SDtfs, 631 SDslu, 1729 SDs, 0 SdLazy, 1663 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=11, 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.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 267893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...