/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:20:36,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:20:36,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:20:36,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:20:36,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:20:36,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:20:36,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:20:36,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:20:36,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:20:36,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:20:36,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:20:36,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:20:36,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:20:36,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:20:36,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:20:36,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:20:36,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:20:36,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:20:36,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:20:36,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:20:36,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:20:36,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:20:36,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:20:36,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:20:36,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:20:36,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:20:36,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:20:36,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:20:36,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:20:36,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:20:36,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:20:36,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:20:36,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:20:36,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:20:36,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:20:36,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:20:36,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:20:36,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:20:36,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:20:36,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:20:36,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:20:36,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:20:36,506 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:20:36,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:20:36,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:20:36,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:20:36,508 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:20:36,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:20:36,509 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:20:36,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:20:36,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:20:36,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:20:36,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:20:36,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:20:36,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:20:36,510 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:20:36,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:20:36,510 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:20:36,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:20:36,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:20:36,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:20:36,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:20:36,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:20:36,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:20:36,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:20:36,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:20:36,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:20:36,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:20:36,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:20:36,513 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:20:36,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:20:36,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:20:36,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:20:36,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:20:36,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:20:36,809 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:20:36,809 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:20:36,810 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2020-10-11 18:20:36,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89376226c/2f7cb0a692964075afef58ced766d611/FLAGbe07930f6 [2020-10-11 18:20:37,436 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:20:37,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2020-10-11 18:20:37,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89376226c/2f7cb0a692964075afef58ced766d611/FLAGbe07930f6 [2020-10-11 18:20:37,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89376226c/2f7cb0a692964075afef58ced766d611 [2020-10-11 18:20:37,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:20:37,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:20:37,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:20:37,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:20:37,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:20:37,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:20:37" (1/1) ... [2020-10-11 18:20:37,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abbea44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:37, skipping insertion in model container [2020-10-11 18:20:37,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:20:37" (1/1) ... [2020-10-11 18:20:37,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:20:37,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:20:38,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:20:38,284 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:20:38,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:20:38,422 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:20:38,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38 WrapperNode [2020-10-11 18:20:38,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:20:38,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:20:38,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:20:38,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:20:38,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:20:38,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:20:38,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:20:38,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:20:38,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... [2020-10-11 18:20:38,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:20:38,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:20:38,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:20:38,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:20:38,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:20:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:20:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:20:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:20:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:20:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:20:38,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:20:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:20:38,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:20:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:20:38,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:20:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:20:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:20:38,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:20:38,600 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:20:40,543 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:20:40,543 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:20:40,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:20:40 BoogieIcfgContainer [2020-10-11 18:20:40,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:20:40,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:20:40,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:20:40,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:20:40,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:20:37" (1/3) ... [2020-10-11 18:20:40,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d26f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:20:40, skipping insertion in model container [2020-10-11 18:20:40,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:38" (2/3) ... [2020-10-11 18:20:40,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d26f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:20:40, skipping insertion in model container [2020-10-11 18:20:40,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:20:40" (3/3) ... [2020-10-11 18:20:40,555 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2020-10-11 18:20:40,567 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:20:40,575 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:20:40,576 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:20:40,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,607 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,608 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,614 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,614 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,621 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,622 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,634 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:20:40,653 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:20:40,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:20:40,676 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:20:40,677 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:20:40,677 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:20:40,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:20:40,677 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:20:40,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:20:40,677 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:20:40,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-11 18:20:40,743 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-11 18:20:40,743 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:40,748 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-11 18:20:40,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2020-10-11 18:20:40,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2020-10-11 18:20:40,773 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2020-10-11 18:20:40,773 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:40,773 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:40,775 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:40,775 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2009263669, now seen corresponding path program 1 times [2020-10-11 18:20:40,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:40,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692927531] [2020-10-11 18:20:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:41,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692927531] [2020-10-11 18:20:41,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:41,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:20:41,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19805630] [2020-10-11 18:20:41,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:20:41,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:20:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:20:41,314 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 96 [2020-10-11 18:20:41,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 195 flow. Second operand 3 states. [2020-10-11 18:20:41,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:41,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 96 [2020-10-11 18:20:41,318 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:41,401 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2020-10-11 18:20:41,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:41,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 90 events. 0/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:20:41,403 INFO L132 encePairwiseOnDemand]: 91/96 looper letters, 0 selfloop transitions, 2 changer transitions 11/90 dead transitions. [2020-10-11 18:20:41,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 193 flow [2020-10-11 18:20:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:20:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:20:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2020-10-11 18:20:41,421 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9722222222222222 [2020-10-11 18:20:41,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2020-10-11 18:20:41,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2020-10-11 18:20:41,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:41,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2020-10-11 18:20:41,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:20:41,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:20:41,439 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:20:41,441 INFO L185 Difference]: Start difference. First operand has 101 places, 93 transitions, 195 flow. Second operand 3 states and 280 transitions. [2020-10-11 18:20:41,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 90 transitions, 193 flow [2020-10-11 18:20:41,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 90 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:20:41,449 INFO L241 Difference]: Finished difference. Result has 99 places, 79 transitions, 168 flow [2020-10-11 18:20:41,452 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2020-10-11 18:20:41,453 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2020-10-11 18:20:41,454 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 168 flow [2020-10-11 18:20:41,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:20:41,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:41,454 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:41,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:20:41,455 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash -384256892, now seen corresponding path program 1 times [2020-10-11 18:20:41,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:41,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270739063] [2020-10-11 18:20:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:41,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270739063] [2020-10-11 18:20:41,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:41,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:20:41,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251911619] [2020-10-11 18:20:41,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:20:41,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:20:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:20:41,885 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 96 [2020-10-11 18:20:41,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 168 flow. Second operand 6 states. [2020-10-11 18:20:41,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:41,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 96 [2020-10-11 18:20:41,886 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:42,042 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-10-11 18:20:42,042 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:20:42,043 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 91. Up to 7 conditions per place. [2020-10-11 18:20:42,044 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 6 selfloop transitions, 2 changer transitions 10/89 dead transitions. [2020-10-11 18:20:42,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 224 flow [2020-10-11 18:20:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:20:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:20:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 794 transitions. [2020-10-11 18:20:42,050 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9189814814814815 [2020-10-11 18:20:42,051 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 794 transitions. [2020-10-11 18:20:42,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 794 transitions. [2020-10-11 18:20:42,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:42,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 794 transitions. [2020-10-11 18:20:42,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:20:42,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:20:42,058 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:20:42,059 INFO L185 Difference]: Start difference. First operand has 99 places, 79 transitions, 168 flow. Second operand 9 states and 794 transitions. [2020-10-11 18:20:42,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 224 flow [2020-10-11 18:20:42,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:20:42,063 INFO L241 Difference]: Finished difference. Result has 101 places, 79 transitions, 184 flow [2020-10-11 18:20:42,063 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=101, PETRI_TRANSITIONS=79} [2020-10-11 18:20:42,064 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2020-10-11 18:20:42,064 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 79 transitions, 184 flow [2020-10-11 18:20:42,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:20:42,064 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:42,065 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:42,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:20:42,065 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1448583577, now seen corresponding path program 1 times [2020-10-11 18:20:42,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:42,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586670683] [2020-10-11 18:20:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:42,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586670683] [2020-10-11 18:20:42,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:42,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:20:42,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658401106] [2020-10-11 18:20:42,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:20:42,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:20:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:20:42,961 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 96 [2020-10-11 18:20:42,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 79 transitions, 184 flow. Second operand 10 states. [2020-10-11 18:20:42,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:42,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 96 [2020-10-11 18:20:42,962 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:43,327 INFO L129 PetriNetUnfolder]: 64/248 cut-off events. [2020-10-11 18:20:43,327 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-11 18:20:43,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 248 events. 64/248 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 978 event pairs, 25 based on Foata normal form. 6/249 useless extension candidates. Maximal degree in co-relation 426. Up to 81 conditions per place. [2020-10-11 18:20:43,335 INFO L132 encePairwiseOnDemand]: 84/96 looper letters, 13 selfloop transitions, 9 changer transitions 22/107 dead transitions. [2020-10-11 18:20:43,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 346 flow [2020-10-11 18:20:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:20:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:20:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1124 transitions. [2020-10-11 18:20:43,342 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8363095238095238 [2020-10-11 18:20:43,342 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1124 transitions. [2020-10-11 18:20:43,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1124 transitions. [2020-10-11 18:20:43,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:43,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1124 transitions. [2020-10-11 18:20:43,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:20:43,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:20:43,348 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:20:43,348 INFO L185 Difference]: Start difference. First operand has 101 places, 79 transitions, 184 flow. Second operand 14 states and 1124 transitions. [2020-10-11 18:20:43,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 346 flow [2020-10-11 18:20:43,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 314 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:20:43,358 INFO L241 Difference]: Finished difference. Result has 108 places, 83 transitions, 226 flow [2020-10-11 18:20:43,358 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=226, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2020-10-11 18:20:43,359 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2020-10-11 18:20:43,359 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 226 flow [2020-10-11 18:20:43,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:20:43,359 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:43,359 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:43,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:20:43,359 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash 495449988, now seen corresponding path program 1 times [2020-10-11 18:20:43,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:43,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355850041] [2020-10-11 18:20:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:43,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355850041] [2020-10-11 18:20:43,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:43,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:20:43,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861465450] [2020-10-11 18:20:43,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:20:43,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:20:43,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:20:43,706 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2020-10-11 18:20:43,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 226 flow. Second operand 6 states. [2020-10-11 18:20:43,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:43,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2020-10-11 18:20:43,707 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:43,926 INFO L129 PetriNetUnfolder]: 129/427 cut-off events. [2020-10-11 18:20:43,927 INFO L130 PetriNetUnfolder]: For 131/134 co-relation queries the response was YES. [2020-10-11 18:20:43,930 INFO L80 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 427 events. 129/427 cut-off events. For 131/134 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2318 event pairs, 28 based on Foata normal form. 10/413 useless extension candidates. Maximal degree in co-relation 772. Up to 104 conditions per place. [2020-10-11 18:20:43,933 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 17 selfloop transitions, 14 changer transitions 4/108 dead transitions. [2020-10-11 18:20:43,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 346 flow [2020-10-11 18:20:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:20:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:20:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2020-10-11 18:20:43,937 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2020-10-11 18:20:43,937 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2020-10-11 18:20:43,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2020-10-11 18:20:43,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:43,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2020-10-11 18:20:43,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:20:43,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:20:43,942 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:20:43,942 INFO L185 Difference]: Start difference. First operand has 108 places, 83 transitions, 226 flow. Second operand 9 states and 784 transitions. [2020-10-11 18:20:43,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 346 flow [2020-10-11 18:20:43,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 332 flow, removed 3 selfloop flow, removed 7 redundant places. [2020-10-11 18:20:43,948 INFO L241 Difference]: Finished difference. Result has 108 places, 95 transitions, 312 flow [2020-10-11 18:20:43,948 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=108, PETRI_TRANSITIONS=95} [2020-10-11 18:20:43,948 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2020-10-11 18:20:43,949 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 95 transitions, 312 flow [2020-10-11 18:20:43,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:20:43,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:43,949 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:43,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:20:43,950 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash 927932134, now seen corresponding path program 1 times [2020-10-11 18:20:43,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:43,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842893989] [2020-10-11 18:20:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:44,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:20:44,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842893989] [2020-10-11 18:20:44,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:44,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:20:44,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169863262] [2020-10-11 18:20:44,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:20:44,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:20:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:20:44,286 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2020-10-11 18:20:44,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 95 transitions, 312 flow. Second operand 7 states. [2020-10-11 18:20:44,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:44,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2020-10-11 18:20:44,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:44,640 INFO L129 PetriNetUnfolder]: 115/403 cut-off events. [2020-10-11 18:20:44,641 INFO L130 PetriNetUnfolder]: For 718/1019 co-relation queries the response was YES. [2020-10-11 18:20:44,643 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 403 events. 115/403 cut-off events. For 718/1019 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2163 event pairs, 4 based on Foata normal form. 46/428 useless extension candidates. Maximal degree in co-relation 1119. Up to 125 conditions per place. [2020-10-11 18:20:44,645 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 15 selfloop transitions, 27 changer transitions 8/123 dead transitions. [2020-10-11 18:20:44,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 123 transitions, 593 flow [2020-10-11 18:20:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:20:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:20:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1044 transitions. [2020-10-11 18:20:44,649 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.90625 [2020-10-11 18:20:44,649 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1044 transitions. [2020-10-11 18:20:44,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1044 transitions. [2020-10-11 18:20:44,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:44,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1044 transitions. [2020-10-11 18:20:44,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:20:44,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:20:44,655 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:20:44,655 INFO L185 Difference]: Start difference. First operand has 108 places, 95 transitions, 312 flow. Second operand 12 states and 1044 transitions. [2020-10-11 18:20:44,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 123 transitions, 593 flow [2020-10-11 18:20:44,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:20:44,661 INFO L241 Difference]: Finished difference. Result has 123 places, 111 transitions, 523 flow [2020-10-11 18:20:44,661 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=523, PETRI_PLACES=123, PETRI_TRANSITIONS=111} [2020-10-11 18:20:44,662 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 22 predicate places. [2020-10-11 18:20:44,662 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 111 transitions, 523 flow [2020-10-11 18:20:44,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:20:44,662 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:44,662 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:44,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:20:44,663 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1417756904, now seen corresponding path program 1 times [2020-10-11 18:20:44,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:44,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933377904] [2020-10-11 18:20:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:44,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933377904] [2020-10-11 18:20:44,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:44,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:20:44,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376798163] [2020-10-11 18:20:44,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:20:44,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:20:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:20:45,012 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2020-10-11 18:20:45,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 111 transitions, 523 flow. Second operand 8 states. [2020-10-11 18:20:45,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:45,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2020-10-11 18:20:45,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:45,349 INFO L129 PetriNetUnfolder]: 82/338 cut-off events. [2020-10-11 18:20:45,349 INFO L130 PetriNetUnfolder]: For 1449/2488 co-relation queries the response was YES. [2020-10-11 18:20:45,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 338 events. 82/338 cut-off events. For 1449/2488 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1829 event pairs, 0 based on Foata normal form. 65/383 useless extension candidates. Maximal degree in co-relation 1176. Up to 97 conditions per place. [2020-10-11 18:20:45,354 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 10 selfloop transitions, 32 changer transitions 15/130 dead transitions. [2020-10-11 18:20:45,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 130 transitions, 775 flow [2020-10-11 18:20:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:20:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:20:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1292 transitions. [2020-10-11 18:20:45,359 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8972222222222223 [2020-10-11 18:20:45,359 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1292 transitions. [2020-10-11 18:20:45,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1292 transitions. [2020-10-11 18:20:45,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:45,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1292 transitions. [2020-10-11 18:20:45,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:20:45,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:20:45,367 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:20:45,367 INFO L185 Difference]: Start difference. First operand has 123 places, 111 transitions, 523 flow. Second operand 15 states and 1292 transitions. [2020-10-11 18:20:45,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 130 transitions, 775 flow [2020-10-11 18:20:45,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 130 transitions, 689 flow, removed 35 selfloop flow, removed 8 redundant places. [2020-10-11 18:20:45,378 INFO L241 Difference]: Finished difference. Result has 135 places, 112 transitions, 545 flow [2020-10-11 18:20:45,379 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=545, PETRI_PLACES=135, PETRI_TRANSITIONS=112} [2020-10-11 18:20:45,379 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 34 predicate places. [2020-10-11 18:20:45,379 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 112 transitions, 545 flow [2020-10-11 18:20:45,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:20:45,379 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:45,380 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:45,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:20:45,380 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash -211205136, now seen corresponding path program 1 times [2020-10-11 18:20:45,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:45,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413922290] [2020-10-11 18:20:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:45,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413922290] [2020-10-11 18:20:45,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:45,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:20:45,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757121244] [2020-10-11 18:20:45,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:20:45,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:45,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:20:45,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:20:45,831 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2020-10-11 18:20:45,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 112 transitions, 545 flow. Second operand 7 states. [2020-10-11 18:20:45,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:45,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2020-10-11 18:20:45,832 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:45,981 INFO L129 PetriNetUnfolder]: 98/484 cut-off events. [2020-10-11 18:20:45,981 INFO L130 PetriNetUnfolder]: For 1317/1502 co-relation queries the response was YES. [2020-10-11 18:20:45,986 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 484 events. 98/484 cut-off events. For 1317/1502 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3260 event pairs, 0 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1436. Up to 71 conditions per place. [2020-10-11 18:20:45,988 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 9 selfloop transitions, 2 changer transitions 4/117 dead transitions. [2020-10-11 18:20:45,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 117 transitions, 585 flow [2020-10-11 18:20:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:20:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:20:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2020-10-11 18:20:45,991 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8988095238095238 [2020-10-11 18:20:45,991 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 604 transitions. [2020-10-11 18:20:45,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 604 transitions. [2020-10-11 18:20:45,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:45,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 604 transitions. [2020-10-11 18:20:45,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:20:45,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:20:45,995 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:20:45,995 INFO L185 Difference]: Start difference. First operand has 135 places, 112 transitions, 545 flow. Second operand 7 states and 604 transitions. [2020-10-11 18:20:45,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 117 transitions, 585 flow [2020-10-11 18:20:46,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 488 flow, removed 15 selfloop flow, removed 15 redundant places. [2020-10-11 18:20:46,010 INFO L241 Difference]: Finished difference. Result has 129 places, 113 transitions, 467 flow [2020-10-11 18:20:46,010 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=467, PETRI_PLACES=129, PETRI_TRANSITIONS=113} [2020-10-11 18:20:46,010 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 28 predicate places. [2020-10-11 18:20:46,010 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 467 flow [2020-10-11 18:20:46,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:20:46,011 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:46,011 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:46,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:20:46,011 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:46,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:46,012 INFO L82 PathProgramCache]: Analyzing trace with hash -99927440, now seen corresponding path program 2 times [2020-10-11 18:20:46,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:46,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753835979] [2020-10-11 18:20:46,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:20:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:20:46,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753835979] [2020-10-11 18:20:46,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:20:46,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:20:46,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593080766] [2020-10-11 18:20:46,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:20:46,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:20:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:20:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:20:46,460 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2020-10-11 18:20:46,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 113 transitions, 467 flow. Second operand 7 states. [2020-10-11 18:20:46,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:20:46,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2020-10-11 18:20:46,461 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:20:46,659 INFO L129 PetriNetUnfolder]: 196/943 cut-off events. [2020-10-11 18:20:46,659 INFO L130 PetriNetUnfolder]: For 1068/1165 co-relation queries the response was YES. [2020-10-11 18:20:46,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 943 events. 196/943 cut-off events. For 1068/1165 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8272 event pairs, 0 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 2365. Up to 120 conditions per place. [2020-10-11 18:20:46,668 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 9 selfloop transitions, 1 changer transitions 7/118 dead transitions. [2020-10-11 18:20:46,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 118 transitions, 513 flow [2020-10-11 18:20:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:20:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:20:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2020-10-11 18:20:46,671 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8988095238095238 [2020-10-11 18:20:46,671 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 604 transitions. [2020-10-11 18:20:46,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 604 transitions. [2020-10-11 18:20:46,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:20:46,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 604 transitions. [2020-10-11 18:20:46,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:20:46,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:20:46,674 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:20:46,675 INFO L185 Difference]: Start difference. First operand has 129 places, 113 transitions, 467 flow. Second operand 7 states and 604 transitions. [2020-10-11 18:20:46,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 118 transitions, 513 flow [2020-10-11 18:20:46,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 118 transitions, 502 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-11 18:20:46,700 INFO L241 Difference]: Finished difference. Result has 133 places, 111 transitions, 464 flow [2020-10-11 18:20:46,701 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=133, PETRI_TRANSITIONS=111} [2020-10-11 18:20:46,701 INFO L341 CegarLoopForPetriNet]: 101 programPoint places, 32 predicate places. [2020-10-11 18:20:46,701 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 111 transitions, 464 flow [2020-10-11 18:20:46,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:20:46,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:20:46,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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:20:46,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:20:46,702 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:20:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:20:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 164050838, now seen corresponding path program 3 times [2020-10-11 18:20:46,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:20:46,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869248304] [2020-10-11 18:20:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:20:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:20:46,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:20:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:20:46,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:20:46,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:20:46,836 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:20:46,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:20:46,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,890 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,891 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,891 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,891 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,891 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,891 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:46,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:20:46,897 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:20:47,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:20:47 BasicIcfg [2020-10-11 18:20:47,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:20:47,007 INFO L168 Benchmark]: Toolchain (without parser) took 9301.09 ms. Allocated memory was 251.1 MB in the beginning and 496.5 MB in the end (delta: 245.4 MB). Free memory was 206.2 MB in the beginning and 202.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 249.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:20:47,008 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:20:47,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.65 ms. Allocated memory was 251.1 MB in the beginning and 315.6 MB in the end (delta: 64.5 MB). Free memory was 206.2 MB in the beginning and 266.3 MB in the end (delta: -60.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:20:47,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.77 ms. Allocated memory is still 315.6 MB. Free memory was 266.3 MB in the beginning and 261.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:20:47,010 INFO L168 Benchmark]: Boogie Preprocessor took 42.54 ms. Allocated memory is still 315.6 MB. Free memory is still 261.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:20:47,011 INFO L168 Benchmark]: RCFGBuilder took 2014.03 ms. Allocated memory was 315.6 MB in the beginning and 357.6 MB in the end (delta: 41.9 MB). Free memory was 261.3 MB in the beginning and 211.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 100.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:20:47,012 INFO L168 Benchmark]: TraceAbstraction took 6457.13 ms. Allocated memory was 357.6 MB in the beginning and 496.5 MB in the end (delta: 138.9 MB). Free memory was 211.4 MB in the beginning and 202.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:20:47,016 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 716.65 ms. Allocated memory was 251.1 MB in the beginning and 315.6 MB in the end (delta: 64.5 MB). Free memory was 206.2 MB in the beginning and 266.3 MB in the end (delta: -60.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.77 ms. Allocated memory is still 315.6 MB. Free memory was 266.3 MB in the beginning and 261.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 42.54 ms. Allocated memory is still 315.6 MB. Free memory is still 261.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 2014.03 ms. Allocated memory was 315.6 MB in the beginning and 357.6 MB in the end (delta: 41.9 MB). Free memory was 261.3 MB in the beginning and 211.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 100.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6457.13 ms. Allocated memory was 357.6 MB in the beginning and 496.5 MB in the end (delta: 138.9 MB). Free memory was 211.4 MB in the beginning and 202.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L702] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L704] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L706] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L707] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L708] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L710] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L712] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L713] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L714] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L715] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L716] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L717] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L718] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L719] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L720] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L721] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L722] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1108; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1109; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 0 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L819] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 2 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L780] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 y$flush_delayed = weak$$choice2 [L835] 0 y$mem_tmp = y [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L844] 0 y = y$flush_delayed ? y$mem_tmp : y [L845] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 145 SDtfs, 223 SDslu, 524 SDs, 0 SdLazy, 543 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 497 ConstructedInterpolants, 0 QuantifiedInterpolants, 103591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...