/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/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:44:10,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:44:10,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:44:10,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:44:10,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:44:10,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:44:10,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:44:10,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:44:10,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:44:10,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:44:10,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:44:10,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:44:10,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:44:10,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:44:10,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:44:10,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:44:10,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:44:10,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:44:10,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:44:10,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:44:10,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:44:10,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:44:10,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:44:10,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:44:10,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:44:10,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:44:10,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:44:10,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:44:10,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:44:10,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:44:10,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:44:10,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:44:10,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:44:10,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:44:10,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:44:10,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:44:10,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:44:10,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:44:10,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:44:10,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:44:10,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:44:10,538 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:44:10,580 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:44:10,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:44:10,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:44:10,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:44:10,582 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:44:10,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:44:10,582 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:44:10,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:44:10,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:44:10,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:44:10,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:44:10,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:44:10,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:44:10,584 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:44:10,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:44:10,585 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:44:10,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:44:10,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:44:10,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:44:10,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:44:10,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:44:10,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:44:10,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:44:10,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:44:10,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:44:10,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:44:10,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:44:10,588 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:44:10,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:44:10,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:44:10,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:44:10,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:44:10,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:44:10,921 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:44:10,922 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:44:10,922 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-11 18:44:10,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dffb3c1cd/5094f62cfeb843c1bc1e9288bec1eecd/FLAGae440d6bf [2020-10-11 18:44:11,478 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:44:11,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-11 18:44:11,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dffb3c1cd/5094f62cfeb843c1bc1e9288bec1eecd/FLAGae440d6bf [2020-10-11 18:44:11,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dffb3c1cd/5094f62cfeb843c1bc1e9288bec1eecd [2020-10-11 18:44:11,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:44:11,781 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:44:11,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:11,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:44:11,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:44:11,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:11" (1/1) ... [2020-10-11 18:44:11,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f91e9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:11, skipping insertion in model container [2020-10-11 18:44:11,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:11" (1/1) ... [2020-10-11 18:44:11,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:44:11,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:44:12,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:12,375 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:44:12,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:12,513 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:44:12,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12 WrapperNode [2020-10-11 18:44:12,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:12,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:12,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:44:12,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:44:12,524 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:44:12" (1/1) ... [2020-10-11 18:44:12,543 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:44:12" (1/1) ... [2020-10-11 18:44:12,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:12,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:44:12,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:44:12,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:44:12,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (1/1) ... [2020-10-11 18:44:12,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:44:12,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:44:12,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:44:12,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:44:12,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (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:44:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:44:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:44:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:44:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:44:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:44:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:44:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:44:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:44:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:44:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:44:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:44:12,687 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:44:14,475 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:44:14,476 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:44:14,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:14 BoogieIcfgContainer [2020-10-11 18:44:14,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:44:14,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:44:14,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:44:14,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:44:14,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:44:11" (1/3) ... [2020-10-11 18:44:14,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5574ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:14, skipping insertion in model container [2020-10-11 18:44:14,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:12" (2/3) ... [2020-10-11 18:44:14,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5574ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:14, skipping insertion in model container [2020-10-11 18:44:14,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:14" (3/3) ... [2020-10-11 18:44:14,488 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2020-10-11 18:44:14,500 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:44:14,508 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:44:14,509 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:44:14,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,544 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,553 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,553 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,560 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,560 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,561 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:14,581 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 18:44:14,605 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:44:14,605 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:44:14,605 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:44:14,605 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:44:14,606 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:44:14,606 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:44:14,606 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:44:14,606 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:44:14,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-11 18:44:14,663 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-11 18:44:14,663 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:14,668 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-11 18:44:14,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-11 18:44:14,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-11 18:44:14,687 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2020-10-11 18:44:14,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:14,687 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:14,688 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] [2020-10-11 18:44:14,689 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -643034223, now seen corresponding path program 1 times [2020-10-11 18:44:14,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:14,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845147537] [2020-10-11 18:44:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:15,015 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:44:15,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845147537] [2020-10-11 18:44:15,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:15,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:44:15,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307064498] [2020-10-11 18:44:15,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:44:15,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:44:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:44:15,165 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 74 [2020-10-11 18:44:15,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 150 flow. Second operand 3 states. [2020-10-11 18:44:15,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:15,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 74 [2020-10-11 18:44:15,170 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:15,213 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2020-10-11 18:44:15,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:15,214 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:44:15,216 INFO L132 encePairwiseOnDemand]: 69/74 looper letters, 0 selfloop transitions, 2 changer transitions 9/69 dead transitions. [2020-10-11 18:44:15,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 148 flow [2020-10-11 18:44:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:44:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:44:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2020-10-11 18:44:15,234 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.963963963963964 [2020-10-11 18:44:15,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2020-10-11 18:44:15,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2020-10-11 18:44:15,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:15,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2020-10-11 18:44:15,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:44:15,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:44:15,258 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:44:15,260 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 150 flow. Second operand 3 states and 214 transitions. [2020-10-11 18:44:15,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 148 flow [2020-10-11 18:44:15,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 69 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:44:15,270 INFO L241 Difference]: Finished difference. Result has 76 places, 60 transitions, 128 flow [2020-10-11 18:44:15,273 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2020-10-11 18:44:15,275 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2020-10-11 18:44:15,275 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 128 flow [2020-10-11 18:44:15,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:44:15,275 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:15,275 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:44:15,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:44:15,276 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1471555611, now seen corresponding path program 1 times [2020-10-11 18:44:15,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:15,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209790124] [2020-10-11 18:44:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:15,523 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:44:15,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209790124] [2020-10-11 18:44:15,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:15,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:15,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221221190] [2020-10-11 18:44:15,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:15,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:15,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:15,723 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 74 [2020-10-11 18:44:15,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 128 flow. Second operand 6 states. [2020-10-11 18:44:15,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:15,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 74 [2020-10-11 18:44:15,724 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:15,895 INFO L129 PetriNetUnfolder]: 24/163 cut-off events. [2020-10-11 18:44:15,895 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:15,897 INFO L80 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 163 events. 24/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 589 event pairs, 5 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 195. Up to 31 conditions per place. [2020-10-11 18:44:15,898 INFO L132 encePairwiseOnDemand]: 67/74 looper letters, 8 selfloop transitions, 3 changer transitions 19/81 dead transitions. [2020-10-11 18:44:15,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 230 flow [2020-10-11 18:44:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 599 transitions. [2020-10-11 18:44:15,903 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8993993993993994 [2020-10-11 18:44:15,904 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 599 transitions. [2020-10-11 18:44:15,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 599 transitions. [2020-10-11 18:44:15,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:15,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 599 transitions. [2020-10-11 18:44:15,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:15,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:15,912 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:15,913 INFO L185 Difference]: Start difference. First operand has 76 places, 60 transitions, 128 flow. Second operand 9 states and 599 transitions. [2020-10-11 18:44:15,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 81 transitions, 230 flow [2020-10-11 18:44:15,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:44:15,917 INFO L241 Difference]: Finished difference. Result has 80 places, 62 transitions, 167 flow [2020-10-11 18:44:15,917 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=167, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2020-10-11 18:44:15,918 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2020-10-11 18:44:15,918 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 167 flow [2020-10-11 18:44:15,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:15,918 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:15,918 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] [2020-10-11 18:44:15,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:44:15,919 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash 85309990, now seen corresponding path program 1 times [2020-10-11 18:44:15,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:15,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943415361] [2020-10-11 18:44:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:16,227 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:44:16,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943415361] [2020-10-11 18:44:16,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:16,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:16,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982017892] [2020-10-11 18:44:16,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:16,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:16,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:16,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:16,801 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2020-10-11 18:44:16,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 167 flow. Second operand 11 states. [2020-10-11 18:44:16,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:16,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2020-10-11 18:44:16,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:17,298 INFO L129 PetriNetUnfolder]: 137/368 cut-off events. [2020-10-11 18:44:17,298 INFO L130 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2020-10-11 18:44:17,303 INFO L80 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 368 events. 137/368 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1691 event pairs, 59 based on Foata normal form. 14/368 useless extension candidates. Maximal degree in co-relation 830. Up to 129 conditions per place. [2020-10-11 18:44:17,306 INFO L132 encePairwiseOnDemand]: 62/74 looper letters, 13 selfloop transitions, 9 changer transitions 35/103 dead transitions. [2020-10-11 18:44:17,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 103 transitions, 391 flow [2020-10-11 18:44:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:44:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:44:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 940 transitions. [2020-10-11 18:44:17,312 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.793918918918919 [2020-10-11 18:44:17,312 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 940 transitions. [2020-10-11 18:44:17,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 940 transitions. [2020-10-11 18:44:17,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:17,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 940 transitions. [2020-10-11 18:44:17,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:44:17,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:44:17,319 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:44:17,319 INFO L185 Difference]: Start difference. First operand has 80 places, 62 transitions, 167 flow. Second operand 16 states and 940 transitions. [2020-10-11 18:44:17,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 103 transitions, 391 flow [2020-10-11 18:44:17,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 103 transitions, 370 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:17,331 INFO L241 Difference]: Finished difference. Result has 96 places, 66 transitions, 232 flow [2020-10-11 18:44:17,331 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=232, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2020-10-11 18:44:17,331 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2020-10-11 18:44:17,332 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 232 flow [2020-10-11 18:44:17,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:17,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:17,332 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] [2020-10-11 18:44:17,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:44:17,332 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1238327072, now seen corresponding path program 1 times [2020-10-11 18:44:17,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:17,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77256444] [2020-10-11 18:44:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:17,657 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:44:17,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77256444] [2020-10-11 18:44:17,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:17,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:17,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156484238] [2020-10-11 18:44:17,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:17,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:18,554 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 74 [2020-10-11 18:44:18,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 66 transitions, 232 flow. Second operand 9 states. [2020-10-11 18:44:18,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:18,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 74 [2020-10-11 18:44:18,555 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:19,027 INFO L129 PetriNetUnfolder]: 79/269 cut-off events. [2020-10-11 18:44:19,027 INFO L130 PetriNetUnfolder]: For 838/920 co-relation queries the response was YES. [2020-10-11 18:44:19,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 269 events. 79/269 cut-off events. For 838/920 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1133 event pairs, 20 based on Foata normal form. 9/272 useless extension candidates. Maximal degree in co-relation 842. Up to 86 conditions per place. [2020-10-11 18:44:19,031 INFO L132 encePairwiseOnDemand]: 65/74 looper letters, 17 selfloop transitions, 7 changer transitions 25/98 dead transitions. [2020-10-11 18:44:19,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 558 flow [2020-10-11 18:44:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:44:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:44:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 861 transitions. [2020-10-11 18:44:19,035 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.831081081081081 [2020-10-11 18:44:19,035 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 861 transitions. [2020-10-11 18:44:19,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 861 transitions. [2020-10-11 18:44:19,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:19,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 861 transitions. [2020-10-11 18:44:19,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:44:19,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:44:19,041 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:44:19,041 INFO L185 Difference]: Start difference. First operand has 96 places, 66 transitions, 232 flow. Second operand 14 states and 861 transitions. [2020-10-11 18:44:19,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 558 flow [2020-10-11 18:44:19,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 528 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-11 18:44:19,049 INFO L241 Difference]: Finished difference. Result has 104 places, 68 transitions, 277 flow [2020-10-11 18:44:19,049 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=277, PETRI_PLACES=104, PETRI_TRANSITIONS=68} [2020-10-11 18:44:19,049 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 27 predicate places. [2020-10-11 18:44:19,050 INFO L481 AbstractCegarLoop]: Abstraction has has 104 places, 68 transitions, 277 flow [2020-10-11 18:44:19,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:19,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:19,050 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] [2020-10-11 18:44:19,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:44:19,051 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash -862354673, now seen corresponding path program 1 times [2020-10-11 18:44:19,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:19,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772399026] [2020-10-11 18:44:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:19,337 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:44:19,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772399026] [2020-10-11 18:44:19,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:19,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:44:19,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878617944] [2020-10-11 18:44:19,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:44:19,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:44:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:44:20,556 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 74 [2020-10-11 18:44:20,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 68 transitions, 277 flow. Second operand 12 states. [2020-10-11 18:44:20,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:20,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 74 [2020-10-11 18:44:20,560 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:20,907 INFO L129 PetriNetUnfolder]: 52/237 cut-off events. [2020-10-11 18:44:20,907 INFO L130 PetriNetUnfolder]: For 1275/1387 co-relation queries the response was YES. [2020-10-11 18:44:20,909 INFO L80 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 237 events. 52/237 cut-off events. For 1275/1387 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 989 event pairs, 6 based on Foata normal form. 12/242 useless extension candidates. Maximal degree in co-relation 849. Up to 44 conditions per place. [2020-10-11 18:44:20,911 INFO L132 encePairwiseOnDemand]: 64/74 looper letters, 18 selfloop transitions, 8 changer transitions 19/92 dead transitions. [2020-10-11 18:44:20,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 92 transitions, 617 flow [2020-10-11 18:44:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 784 transitions. [2020-10-11 18:44:20,915 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.814968814968815 [2020-10-11 18:44:20,916 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 784 transitions. [2020-10-11 18:44:20,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 784 transitions. [2020-10-11 18:44:20,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:20,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 784 transitions. [2020-10-11 18:44:20,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:20,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:20,920 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:20,921 INFO L185 Difference]: Start difference. First operand has 104 places, 68 transitions, 277 flow. Second operand 13 states and 784 transitions. [2020-10-11 18:44:20,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 92 transitions, 617 flow [2020-10-11 18:44:20,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 542 flow, removed 33 selfloop flow, removed 8 redundant places. [2020-10-11 18:44:20,929 INFO L241 Difference]: Finished difference. Result has 106 places, 68 transitions, 279 flow [2020-10-11 18:44:20,929 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=279, PETRI_PLACES=106, PETRI_TRANSITIONS=68} [2020-10-11 18:44:20,930 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2020-10-11 18:44:20,930 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 68 transitions, 279 flow [2020-10-11 18:44:20,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:44:20,930 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:20,930 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] [2020-10-11 18:44:20,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:44:20,931 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash -832458424, now seen corresponding path program 1 times [2020-10-11 18:44:20,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:20,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665156636] [2020-10-11 18:44:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:21,081 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:44:21,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665156636] [2020-10-11 18:44:21,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:21,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:21,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502259014] [2020-10-11 18:44:21,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:21,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:21,229 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 74 [2020-10-11 18:44:21,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 68 transitions, 279 flow. Second operand 6 states. [2020-10-11 18:44:21,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:21,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 74 [2020-10-11 18:44:21,230 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:21,422 INFO L129 PetriNetUnfolder]: 19/185 cut-off events. [2020-10-11 18:44:21,422 INFO L130 PetriNetUnfolder]: For 975/1167 co-relation queries the response was YES. [2020-10-11 18:44:21,424 INFO L80 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 185 events. 19/185 cut-off events. For 975/1167 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 777 event pairs, 10 based on Foata normal form. 7/188 useless extension candidates. Maximal degree in co-relation 572. Up to 34 conditions per place. [2020-10-11 18:44:21,426 INFO L132 encePairwiseOnDemand]: 68/74 looper letters, 7 selfloop transitions, 2 changer transitions 16/78 dead transitions. [2020-10-11 18:44:21,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 78 transitions, 423 flow [2020-10-11 18:44:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 589 transitions. [2020-10-11 18:44:21,430 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8843843843843844 [2020-10-11 18:44:21,430 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 589 transitions. [2020-10-11 18:44:21,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 589 transitions. [2020-10-11 18:44:21,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:21,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 589 transitions. [2020-10-11 18:44:21,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:21,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:21,436 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:21,436 INFO L185 Difference]: Start difference. First operand has 106 places, 68 transitions, 279 flow. Second operand 9 states and 589 transitions. [2020-10-11 18:44:21,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 78 transitions, 423 flow [2020-10-11 18:44:21,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 333 flow, removed 39 selfloop flow, removed 17 redundant places. [2020-10-11 18:44:21,447 INFO L241 Difference]: Finished difference. Result has 98 places, 62 transitions, 215 flow [2020-10-11 18:44:21,448 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=98, PETRI_TRANSITIONS=62} [2020-10-11 18:44:21,448 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2020-10-11 18:44:21,448 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 62 transitions, 215 flow [2020-10-11 18:44:21,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:21,449 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:21,449 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] [2020-10-11 18:44:21,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:44:21,450 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1217342293, now seen corresponding path program 1 times [2020-10-11 18:44:21,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:21,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454457127] [2020-10-11 18:44:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:21,633 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:44:21,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454457127] [2020-10-11 18:44:21,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:21,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:21,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803321240] [2020-10-11 18:44:21,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:21,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:21,744 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 74 [2020-10-11 18:44:21,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 62 transitions, 215 flow. Second operand 6 states. [2020-10-11 18:44:21,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:21,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 74 [2020-10-11 18:44:21,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:21,889 INFO L129 PetriNetUnfolder]: 56/268 cut-off events. [2020-10-11 18:44:21,890 INFO L130 PetriNetUnfolder]: For 255/258 co-relation queries the response was YES. [2020-10-11 18:44:21,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 268 events. 56/268 cut-off events. For 255/258 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1341 event pairs, 16 based on Foata normal form. 7/266 useless extension candidates. Maximal degree in co-relation 504. Up to 53 conditions per place. [2020-10-11 18:44:21,894 INFO L132 encePairwiseOnDemand]: 66/74 looper letters, 8 selfloop transitions, 5 changer transitions 15/81 dead transitions. [2020-10-11 18:44:21,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 81 transitions, 309 flow [2020-10-11 18:44:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 588 transitions. [2020-10-11 18:44:21,899 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8828828828828829 [2020-10-11 18:44:21,899 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 588 transitions. [2020-10-11 18:44:21,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 588 transitions. [2020-10-11 18:44:21,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:21,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 588 transitions. [2020-10-11 18:44:21,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:21,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:21,905 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:21,906 INFO L185 Difference]: Start difference. First operand has 98 places, 62 transitions, 215 flow. Second operand 9 states and 588 transitions. [2020-10-11 18:44:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 81 transitions, 309 flow [2020-10-11 18:44:21,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 266 flow, removed 14 selfloop flow, removed 15 redundant places. [2020-10-11 18:44:21,910 INFO L241 Difference]: Finished difference. Result has 90 places, 64 transitions, 216 flow [2020-10-11 18:44:21,911 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=90, PETRI_TRANSITIONS=64} [2020-10-11 18:44:21,911 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2020-10-11 18:44:21,911 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 216 flow [2020-10-11 18:44:21,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:21,912 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:21,912 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] [2020-10-11 18:44:21,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:44:21,912 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 488461573, now seen corresponding path program 1 times [2020-10-11 18:44:21,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:21,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239706836] [2020-10-11 18:44:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:22,096 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:44:22,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239706836] [2020-10-11 18:44:22,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:22,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:44:22,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760805427] [2020-10-11 18:44:22,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:44:22,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:44:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:44:22,187 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 74 [2020-10-11 18:44:22,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 216 flow. Second operand 7 states. [2020-10-11 18:44:22,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:22,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 74 [2020-10-11 18:44:22,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:22,317 INFO L129 PetriNetUnfolder]: 16/133 cut-off events. [2020-10-11 18:44:22,318 INFO L130 PetriNetUnfolder]: For 141/145 co-relation queries the response was YES. [2020-10-11 18:44:22,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 133 events. 16/133 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 399 event pairs, 0 based on Foata normal form. 8/140 useless extension candidates. Maximal degree in co-relation 316. Up to 33 conditions per place. [2020-10-11 18:44:22,319 INFO L132 encePairwiseOnDemand]: 66/74 looper letters, 4 selfloop transitions, 7 changer transitions 13/75 dead transitions. [2020-10-11 18:44:22,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 75 transitions, 325 flow [2020-10-11 18:44:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:44:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:44:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 644 transitions. [2020-10-11 18:44:22,322 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8702702702702703 [2020-10-11 18:44:22,322 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 644 transitions. [2020-10-11 18:44:22,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 644 transitions. [2020-10-11 18:44:22,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:22,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 644 transitions. [2020-10-11 18:44:22,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:44:22,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:44:22,326 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:44:22,326 INFO L185 Difference]: Start difference. First operand has 90 places, 64 transitions, 216 flow. Second operand 10 states and 644 transitions. [2020-10-11 18:44:22,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 75 transitions, 325 flow [2020-10-11 18:44:22,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 75 transitions, 266 flow, removed 23 selfloop flow, removed 11 redundant places. [2020-10-11 18:44:22,329 INFO L241 Difference]: Finished difference. Result has 90 places, 62 transitions, 198 flow [2020-10-11 18:44:22,329 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=198, PETRI_PLACES=90, PETRI_TRANSITIONS=62} [2020-10-11 18:44:22,330 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2020-10-11 18:44:22,330 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 198 flow [2020-10-11 18:44:22,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:44:22,330 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:22,330 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:22,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:44:22,331 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1312853932, now seen corresponding path program 1 times [2020-10-11 18:44:22,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:22,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986502960] [2020-10-11 18:44:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:44:22,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:44:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:44:22,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:44:22,463 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:44:22,463 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:44:22,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:44:22,487 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:44:22,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,488 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:44:22,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,489 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:44:22,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,489 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:44:22,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,490 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:44:22,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,490 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:44:22,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,490 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:44:22,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,491 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:44:22,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,491 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:44:22,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,491 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:44:22,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,492 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:44:22,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,492 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:44:22,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,492 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:44:22,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,493 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:44:22,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,494 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:44:22,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,494 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:44:22,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,494 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:44:22,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,495 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:44:22,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,495 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:44:22,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,496 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:44:22,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,496 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:44:22,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,496 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:44:22,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,497 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:44:22,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,497 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:44:22,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,497 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:44:22,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,498 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:44:22,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,498 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:44:22,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,498 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:44:22,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:22,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:44:22 BasicIcfg [2020-10-11 18:44:22,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:44:22,612 INFO L168 Benchmark]: Toolchain (without parser) took 10825.34 ms. Allocated memory was 251.1 MB in the beginning and 504.4 MB in the end (delta: 253.2 MB). Free memory was 204.4 MB in the beginning and 375.4 MB in the end (delta: -171.0 MB). Peak memory consumption was 82.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:22,613 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory was 226.7 MB in the beginning and 225.8 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-11 18:44:22,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.13 ms. Allocated memory was 251.1 MB in the beginning and 313.0 MB in the end (delta: 61.9 MB). Free memory was 204.4 MB in the beginning and 265.7 MB in the end (delta: -61.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:22,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.57 ms. Allocated memory is still 313.0 MB. Free memory was 265.7 MB in the beginning and 262.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:22,618 INFO L168 Benchmark]: Boogie Preprocessor took 37.32 ms. Allocated memory is still 313.0 MB. Free memory was 262.3 MB in the beginning and 259.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:22,619 INFO L168 Benchmark]: RCFGBuilder took 1862.58 ms. Allocated memory was 313.0 MB in the beginning and 359.7 MB in the end (delta: 46.7 MB). Free memory was 259.8 MB in the beginning and 217.4 MB in the end (delta: 42.4 MB). Peak memory consumption was 101.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:22,622 INFO L168 Benchmark]: TraceAbstraction took 8124.46 ms. Allocated memory was 359.7 MB in the beginning and 504.4 MB in the end (delta: 144.7 MB). Free memory was 215.1 MB in the beginning and 375.4 MB in the end (delta: -160.2 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:44:22,630 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.21 ms. Allocated memory is still 251.1 MB. Free memory was 226.7 MB in the beginning and 225.8 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 732.13 ms. Allocated memory was 251.1 MB in the beginning and 313.0 MB in the end (delta: 61.9 MB). Free memory was 204.4 MB in the beginning and 265.7 MB in the end (delta: -61.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.57 ms. Allocated memory is still 313.0 MB. Free memory was 265.7 MB in the beginning and 262.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.32 ms. Allocated memory is still 313.0 MB. Free memory was 262.3 MB in the beginning and 259.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1862.58 ms. Allocated memory was 313.0 MB in the beginning and 359.7 MB in the end (delta: 46.7 MB). Free memory was 259.8 MB in the beginning and 217.4 MB in the end (delta: 42.4 MB). Peak memory consumption was 101.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8124.46 ms. Allocated memory was 359.7 MB in the beginning and 504.4 MB in the end (delta: 144.7 MB). Free memory was 215.1 MB in the beginning and 375.4 MB in the end (delta: -160.2 MB). There was no memory consumed. 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: [L697] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 0 pthread_t t2483; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2484; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 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: 7.8s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 297 SDslu, 787 SDs, 0 SdLazy, 781 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=5, 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, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 90754 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...